./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-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 e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:06:52,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:06:53,036 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:06:53,040 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:06:53,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:06:53,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:06:53,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:06:53,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:06:53,063 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:06:53,064 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:06:53,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:06:53,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:06:53,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:06:53,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:06:53,065 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:06:53,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:06:53,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:06:53,066 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:06:53,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:06:53,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:06:53,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:06:53,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:06:53,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:06:53,066 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:06:53,066 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:06:53,066 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:06:53,066 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:06:53,066 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:06:53,066 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:06:53,066 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:06:53,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:06:53,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:06:53,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:06:53,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:06:53,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:06:53,067 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:06:53,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:06:53,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:06:53,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:06:53,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:06:53,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:06:53,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:06:53,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:06:53,068 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 -> e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 [2025-03-14 01:06:53,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:06:53,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:06:53,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:06:53,308 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:06:53,308 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:06:53,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-03-14 01:06:54,444 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2fbdd5e8/92042815669e4f72a623c3fdc109f1cc/FLAG85a09ea48 [2025-03-14 01:06:54,654 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:06:54,655 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-03-14 01:06:54,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2fbdd5e8/92042815669e4f72a623c3fdc109f1cc/FLAG85a09ea48 [2025-03-14 01:06:55,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2fbdd5e8/92042815669e4f72a623c3fdc109f1cc [2025-03-14 01:06:55,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:06:55,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:06:55,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:06:55,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:06:55,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:06:55,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf0269b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55, skipping insertion in model container [2025-03-14 01:06:55,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:06:55,166 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c[2423,2436] [2025-03-14 01:06:55,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:06:55,180 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:06:55,192 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c[2423,2436] [2025-03-14 01:06:55,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:06:55,208 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:06:55,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55 WrapperNode [2025-03-14 01:06:55,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:06:55,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:06:55,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:06:55,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:06:55,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,219 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,235 INFO L138 Inliner]: procedures = 22, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 249 [2025-03-14 01:06:55,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:06:55,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:06:55,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:06:55,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:06:55,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,255 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-14 01:06:55,255 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,255 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,266 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:06:55,271 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:06:55,271 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:06:55,271 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:06:55,272 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (1/1) ... [2025-03-14 01:06:55,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:06:55,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:06:55,295 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:06:55,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:06:55,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:06:55,313 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:06:55,313 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:06:55,313 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:06:55,313 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:06:55,313 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:06:55,313 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:06:55,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:06:55,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 01:06:55,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 01:06:55,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 01:06:55,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:06:55,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:06:55,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:06:55,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 01:06:55,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 01:06:55,315 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:06:55,419 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:06:55,421 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:06:55,823 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:06:55,823 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:06:55,823 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:06:56,136 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:06:56,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:06:56 BoogieIcfgContainer [2025-03-14 01:06:56,136 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:06:56,138 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:06:56,138 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:06:56,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:06:56,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:06:55" (1/3) ... [2025-03-14 01:06:56,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695c6288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:06:56, skipping insertion in model container [2025-03-14 01:06:56,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:06:55" (2/3) ... [2025-03-14 01:06:56,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695c6288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:06:56, skipping insertion in model container [2025-03-14 01:06:56,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:06:56" (3/3) ... [2025-03-14 01:06:56,143 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2025-03-14 01:06:56,156 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:06:56,157 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum.wvr.c that has 4 procedures, 29 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-14 01:06:56,157 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:06:56,200 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:06:56,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 87 flow [2025-03-14 01:06:56,247 INFO L124 PetriNetUnfolderBase]: 5/30 cut-off events. [2025-03-14 01:06:56,248 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:06:56,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 5/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 27 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-03-14 01:06:56,254 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 33 transitions, 87 flow [2025-03-14 01:06:56,255 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 29 transitions, 76 flow [2025-03-14 01:06:56,264 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:06:56,277 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;@77fd47d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:06:56,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 01:06:56,290 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:06:56,291 INFO L124 PetriNetUnfolderBase]: 5/28 cut-off events. [2025-03-14 01:06:56,291 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:06:56,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:06:56,292 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:06:56,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:06:56,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:06:56,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1915494120, now seen corresponding path program 1 times [2025-03-14 01:06:56,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:06:56,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267086235] [2025-03-14 01:06:56,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:06:56,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:06:56,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-14 01:06:56,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 01:06:56,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:06:56,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:06:56,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:06:56,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:06:56,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267086235] [2025-03-14 01:06:56,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267086235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:06:56,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:06:56,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:06:56,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248741888] [2025-03-14 01:06:56,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:06:56,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:06:56,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:06:56,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:06:56,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:06:56,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-14 01:06:56,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:06:56,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:06:56,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-14 01:06:56,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:06:56,853 INFO L124 PetriNetUnfolderBase]: 818/1181 cut-off events. [2025-03-14 01:06:56,853 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-03-14 01:06:56,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2482 conditions, 1181 events. 818/1181 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4425 event pairs, 226 based on Foata normal form. 1/936 useless extension candidates. Maximal degree in co-relation 2122. Up to 803 conditions per place. [2025-03-14 01:06:56,865 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 42 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2025-03-14 01:06:56,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 48 transitions, 223 flow [2025-03-14 01:06:56,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:06:56,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:06:56,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-03-14 01:06:56,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-03-14 01:06:56,877 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 76 flow. Second operand 3 states and 60 transitions. [2025-03-14 01:06:56,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 48 transitions, 223 flow [2025-03-14 01:06:56,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 48 transitions, 201 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:06:56,885 INFO L231 Difference]: Finished difference. Result has 31 places, 32 transitions, 90 flow [2025-03-14 01:06:56,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=31, PETRI_TRANSITIONS=32} [2025-03-14 01:06:56,891 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2025-03-14 01:06:56,892 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 32 transitions, 90 flow [2025-03-14 01:06:56,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:06:56,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:06:56,892 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-14 01:06:56,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:06:56,892 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:06:56,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:06:56,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1071297909, now seen corresponding path program 1 times [2025-03-14 01:06:56,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:06:56,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465913524] [2025-03-14 01:06:56,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:06:56,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:06:56,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 01:06:56,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:06:56,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:06:56,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:06:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:06:57,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:06:57,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465913524] [2025-03-14 01:06:57,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465913524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:06:57,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:06:57,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:06:57,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313408396] [2025-03-14 01:06:57,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:06:57,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:06:57,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:06:57,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:06:57,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:06:57,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-14 01:06:57,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 32 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:06:57,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:06:57,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-14 01:06:57,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:06:57,260 INFO L124 PetriNetUnfolderBase]: 819/1186 cut-off events. [2025-03-14 01:06:57,260 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2025-03-14 01:06:57,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2758 conditions, 1186 events. 819/1186 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4186 event pairs, 577 based on Foata normal form. 0/1043 useless extension candidates. Maximal degree in co-relation 780. Up to 1181 conditions per place. [2025-03-14 01:06:57,266 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 29 selfloop transitions, 4 changer transitions 3/37 dead transitions. [2025-03-14 01:06:57,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 172 flow [2025-03-14 01:06:57,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:06:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:06:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2025-03-14 01:06:57,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3393939393939394 [2025-03-14 01:06:57,268 INFO L175 Difference]: Start difference. First operand has 31 places, 32 transitions, 90 flow. Second operand 5 states and 56 transitions. [2025-03-14 01:06:57,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 172 flow [2025-03-14 01:06:57,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:06:57,269 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 114 flow [2025-03-14 01:06:57,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2025-03-14 01:06:57,269 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2025-03-14 01:06:57,269 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 114 flow [2025-03-14 01:06:57,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:06:57,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:06:57,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:06:57,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:06:57,270 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:06:57,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:06:57,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1022037181, now seen corresponding path program 1 times [2025-03-14 01:06:57,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:06:57,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510398535] [2025-03-14 01:06:57,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:06:57,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:06:57,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:06:57,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:06:57,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:06:57,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:06:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:06:57,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:06:57,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510398535] [2025-03-14 01:06:57,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510398535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:06:57,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:06:57,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:06:57,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737030096] [2025-03-14 01:06:57,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:06:57,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:06:57,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:06:57,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:06:57,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:06:57,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-14 01:06:57,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:06:57,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:06:57,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-14 01:06:57,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:06:57,527 INFO L124 PetriNetUnfolderBase]: 830/1199 cut-off events. [2025-03-14 01:06:57,527 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2025-03-14 01:06:57,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2696 conditions, 1199 events. 830/1199 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4165 event pairs, 270 based on Foata normal form. 0/1088 useless extension candidates. Maximal degree in co-relation 2671. Up to 618 conditions per place. [2025-03-14 01:06:57,534 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 43 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2025-03-14 01:06:57,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 246 flow [2025-03-14 01:06:57,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:06:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:06:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-03-14 01:06:57,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-03-14 01:06:57,536 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 114 flow. Second operand 4 states and 57 transitions. [2025-03-14 01:06:57,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 246 flow [2025-03-14 01:06:57,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 234 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-14 01:06:57,538 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 123 flow [2025-03-14 01:06:57,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2025-03-14 01:06:57,538 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2025-03-14 01:06:57,538 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 123 flow [2025-03-14 01:06:57,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:06:57,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:06:57,539 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-14 01:06:57,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:06:57,539 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:06:57,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:06:57,539 INFO L85 PathProgramCache]: Analyzing trace with hash 266988034, now seen corresponding path program 1 times [2025-03-14 01:06:57,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:06:57,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355533672] [2025-03-14 01:06:57,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:06:57,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:06:57,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:06:57,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:06:57,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:06:57,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:06:57,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:06:57,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:06:57,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355533672] [2025-03-14 01:06:57,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355533672] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:06:57,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713062185] [2025-03-14 01:06:57,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:06:57,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:06:57,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:06:57,661 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:06:57,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:06:57,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:06:57,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:06:57,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:06:57,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:06:57,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:06:57,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:06:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:06:57,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:06:57,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:06:57,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713062185] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:06:57,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:06:57,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-14 01:06:57,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943499281] [2025-03-14 01:06:57,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:06:57,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:06:57,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:06:57,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:06:57,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:06:57,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-14 01:06:57,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:06:57,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:06:57,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-14 01:06:57,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:06:58,015 INFO L124 PetriNetUnfolderBase]: 881/1265 cut-off events. [2025-03-14 01:06:58,015 INFO L125 PetriNetUnfolderBase]: For 460/460 co-relation queries the response was YES. [2025-03-14 01:06:58,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3290 conditions, 1265 events. 881/1265 cut-off events. For 460/460 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4550 event pairs, 411 based on Foata normal form. 98/1284 useless extension candidates. Maximal degree in co-relation 3260. Up to 931 conditions per place. [2025-03-14 01:06:58,022 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 48 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2025-03-14 01:06:58,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 295 flow [2025-03-14 01:06:58,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:06:58,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:06:58,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2025-03-14 01:06:58,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-14 01:06:58,025 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 123 flow. Second operand 5 states and 66 transitions. [2025-03-14 01:06:58,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 295 flow [2025-03-14 01:06:58,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:06:58,027 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 140 flow [2025-03-14 01:06:58,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2025-03-14 01:06:58,028 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2025-03-14 01:06:58,029 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 140 flow [2025-03-14 01:06:58,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:06:58,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:06:58,029 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:06:58,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:06:58,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:06:58,230 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:06:58,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:06:58,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1715171265, now seen corresponding path program 1 times [2025-03-14 01:06:58,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:06:58,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498286723] [2025-03-14 01:06:58,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:06:58,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:06:58,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:06:58,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:06:58,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:06:58,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:06:59,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:06:59,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:06:59,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498286723] [2025-03-14 01:06:59,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498286723] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:06:59,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231717751] [2025-03-14 01:06:59,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:06:59,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:06:59,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:06:59,304 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:06:59,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:06:59,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:06:59,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:06:59,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:06:59,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:06:59,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-14 01:06:59,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:06:59,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-14 01:06:59,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:06:59,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-03-14 01:06:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:06:59,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:06:59,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:06:59,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 240 [2025-03-14 01:07:00,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:07:00,274 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 112 treesize of output 104 [2025-03-14 01:07:00,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:07:00,283 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 84 treesize of output 68 [2025-03-14 01:07:00,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:07:00,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231717751] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:07:00,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:07:00,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2025-03-14 01:07:00,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794921166] [2025-03-14 01:07:00,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:07:00,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-14 01:07:00,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:00,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-14 01:07:00,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2025-03-14 01:07:00,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-14 01:07:00,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 140 flow. Second operand has 27 states, 27 states have (on average 6.2592592592592595) internal successors, (169), 27 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:07:00,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:00,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-14 01:07:00,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:01,936 INFO L124 PetriNetUnfolderBase]: 2297/3306 cut-off events. [2025-03-14 01:07:01,936 INFO L125 PetriNetUnfolderBase]: For 2094/2094 co-relation queries the response was YES. [2025-03-14 01:07:01,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9343 conditions, 3306 events. 2297/3306 cut-off events. For 2094/2094 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14408 event pairs, 149 based on Foata normal form. 2/3088 useless extension candidates. Maximal degree in co-relation 6069. Up to 1539 conditions per place. [2025-03-14 01:07:01,948 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 168 selfloop transitions, 62 changer transitions 2/233 dead transitions. [2025-03-14 01:07:01,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 233 transitions, 1257 flow [2025-03-14 01:07:01,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-14 01:07:01,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-14 01:07:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 317 transitions. [2025-03-14 01:07:01,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4176548089591568 [2025-03-14 01:07:01,950 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 140 flow. Second operand 23 states and 317 transitions. [2025-03-14 01:07:01,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 233 transitions, 1257 flow [2025-03-14 01:07:01,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 233 transitions, 1237 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-14 01:07:01,955 INFO L231 Difference]: Finished difference. Result has 70 places, 92 transitions, 594 flow [2025-03-14 01:07:01,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=594, PETRI_PLACES=70, PETRI_TRANSITIONS=92} [2025-03-14 01:07:01,956 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 36 predicate places. [2025-03-14 01:07:01,956 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 92 transitions, 594 flow [2025-03-14 01:07:01,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.2592592592592595) internal successors, (169), 27 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:07:01,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:01,956 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:07:01,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-14 01:07:02,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:07:02,162 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:07:02,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:02,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2134543719, now seen corresponding path program 2 times [2025-03-14 01:07:02,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:02,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496564038] [2025-03-14 01:07:02,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:07:02,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:02,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:07:02,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:07:02,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:07:02,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:02,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:07:02,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:02,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496564038] [2025-03-14 01:07:02,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496564038] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:07:02,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710098690] [2025-03-14 01:07:02,632 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:07:02,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:07:02,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:07:02,634 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:07:02,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 01:07:02,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:07:02,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:07:02,708 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:07:02,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:02,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-14 01:07:02,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:07:02,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-14 01:07:02,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:07:02,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-03-14 01:07:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:07:02,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:07:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:07:03,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710098690] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:07:03,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:07:03,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 21 [2025-03-14 01:07:03,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134428735] [2025-03-14 01:07:03,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:07:03,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-14 01:07:03,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:03,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-14 01:07:03,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2025-03-14 01:07:03,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-14 01:07:03,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 92 transitions, 594 flow. Second operand has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 22 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:07:03,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:03,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-14 01:07:03,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:03,905 INFO L124 PetriNetUnfolderBase]: 2767/4009 cut-off events. [2025-03-14 01:07:03,905 INFO L125 PetriNetUnfolderBase]: For 6564/6564 co-relation queries the response was YES. [2025-03-14 01:07:03,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14076 conditions, 4009 events. 2767/4009 cut-off events. For 6564/6564 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 18562 event pairs, 434 based on Foata normal form. 1/3792 useless extension candidates. Maximal degree in co-relation 8998. Up to 2903 conditions per place. [2025-03-14 01:07:03,926 INFO L140 encePairwiseOnDemand]: 17/33 looper letters, 130 selfloop transitions, 113 changer transitions 1/245 dead transitions. [2025-03-14 01:07:03,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 245 transitions, 2002 flow [2025-03-14 01:07:03,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 01:07:03,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 01:07:03,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 178 transitions. [2025-03-14 01:07:03,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3371212121212121 [2025-03-14 01:07:03,927 INFO L175 Difference]: Start difference. First operand has 70 places, 92 transitions, 594 flow. Second operand 16 states and 178 transitions. [2025-03-14 01:07:03,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 245 transitions, 2002 flow [2025-03-14 01:07:03,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 245 transitions, 1868 flow, removed 63 selfloop flow, removed 2 redundant places. [2025-03-14 01:07:03,943 INFO L231 Difference]: Finished difference. Result has 92 places, 182 transitions, 1575 flow [2025-03-14 01:07:03,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1575, PETRI_PLACES=92, PETRI_TRANSITIONS=182} [2025-03-14 01:07:03,944 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 58 predicate places. [2025-03-14 01:07:03,945 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 182 transitions, 1575 flow [2025-03-14 01:07:03,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 22 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:07:03,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:03,945 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:07:03,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 01:07:04,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:07:04,150 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:07:04,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:04,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1839691619, now seen corresponding path program 3 times [2025-03-14 01:07:04,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:04,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361028021] [2025-03-14 01:07:04,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:07:04,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:04,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:07:04,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:07:04,206 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:07:04,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:07:04,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:04,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361028021] [2025-03-14 01:07:04,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361028021] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:07:04,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722811207] [2025-03-14 01:07:04,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:07:04,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:07:04,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:07:04,690 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:07:04,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 01:07:04,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:07:04,761 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:07:04,761 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:07:04,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:04,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-14 01:07:04,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:07:04,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-14 01:07:04,954 INFO L349 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2025-03-14 01:07:04,954 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 31 treesize of output 43 [2025-03-14 01:07:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:07:05,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:07:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:07:05,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722811207] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:07:05,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:07:05,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 21 [2025-03-14 01:07:05,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619906080] [2025-03-14 01:07:05,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:07:05,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-14 01:07:05,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:05,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-14 01:07:05,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2025-03-14 01:07:05,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-14 01:07:05,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 182 transitions, 1575 flow. Second operand has 22 states, 22 states have (on average 6.181818181818182) internal successors, (136), 22 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:07:05,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:05,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-14 01:07:05,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:07,141 INFO L124 PetriNetUnfolderBase]: 4793/6903 cut-off events. [2025-03-14 01:07:07,141 INFO L125 PetriNetUnfolderBase]: For 19313/19313 co-relation queries the response was YES. [2025-03-14 01:07:07,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29384 conditions, 6903 events. 4793/6903 cut-off events. For 19313/19313 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 34738 event pairs, 632 based on Foata normal form. 1/6904 useless extension candidates. Maximal degree in co-relation 29151. Up to 3850 conditions per place. [2025-03-14 01:07:07,185 INFO L140 encePairwiseOnDemand]: 14/33 looper letters, 273 selfloop transitions, 322 changer transitions 1/597 dead transitions. [2025-03-14 01:07:07,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 597 transitions, 5849 flow [2025-03-14 01:07:07,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-14 01:07:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-14 01:07:07,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 422 transitions. [2025-03-14 01:07:07,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3761140819964349 [2025-03-14 01:07:07,189 INFO L175 Difference]: Start difference. First operand has 92 places, 182 transitions, 1575 flow. Second operand 34 states and 422 transitions. [2025-03-14 01:07:07,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 597 transitions, 5849 flow [2025-03-14 01:07:07,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 597 transitions, 5565 flow, removed 77 selfloop flow, removed 2 redundant places. [2025-03-14 01:07:07,233 INFO L231 Difference]: Finished difference. Result has 146 places, 455 transitions, 4934 flow [2025-03-14 01:07:07,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=4934, PETRI_PLACES=146, PETRI_TRANSITIONS=455} [2025-03-14 01:07:07,234 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 112 predicate places. [2025-03-14 01:07:07,235 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 455 transitions, 4934 flow [2025-03-14 01:07:07,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.181818181818182) internal successors, (136), 22 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:07:07,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:07,235 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:07:07,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 01:07:07,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:07:07,436 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:07:07,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:07,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1624959609, now seen corresponding path program 4 times [2025-03-14 01:07:07,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:07,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912914822] [2025-03-14 01:07:07,437 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:07:07,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:07,445 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:07:07,468 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:07:07,468 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:07:07,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:07:08,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:08,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912914822] [2025-03-14 01:07:08,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912914822] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:07:08,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713150930] [2025-03-14 01:07:08,198 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:07:08,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:07:08,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:07:08,201 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:07:08,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 01:07:08,245 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:07:08,266 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:07:08,266 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:07:08,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:08,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-14 01:07:08,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:07:08,274 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-14 01:07:08,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-14 01:07:08,325 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:07:08,325 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 11 treesize of output 11 [2025-03-14 01:07:08,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-14 01:07:08,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-14 01:07:08,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:07:08,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:07:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:07:12,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713150930] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:07:12,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:07:12,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 28 [2025-03-14 01:07:12,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844236823] [2025-03-14 01:07:12,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:07:12,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-14 01:07:12,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:12,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-14 01:07:12,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=714, Unknown=1, NotChecked=0, Total=812 [2025-03-14 01:07:12,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-14 01:07:12,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 455 transitions, 4934 flow. Second operand has 29 states, 29 states have (on average 6.0) internal successors, (174), 29 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:07:12,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:12,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-14 01:07:12,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:16,945 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-14 01:07:21,232 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-14 01:07:25,312 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-14 01:07:29,561 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-14 01:07:33,701 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-14 01:07:37,738 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-14 01:07:41,772 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-14 01:07:46,082 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-14 01:07:50,107 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-14 01:07:54,190 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-14 01:07:58,218 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-14 01:08:02,482 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-14 01:08:06,511 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-14 01:08:07,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:08:12,131 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-14 01:08:16,150 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-14 01:08:20,324 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-14 01:08:24,344 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-14 01:08:28,438 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-14 01:08:32,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]