./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array3_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array3_pattern.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8c9f77a5f5cfb41429e6b2e557580f5f8a855ca718c241fb5a07541ef3b21ab2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:33:13,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:33:13,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:33:13,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:33:13,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:33:13,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:33:13,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:33:13,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:33:13,462 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:33:13,462 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:33:13,463 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:33:13,463 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:33:13,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:33:13,464 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:33:13,464 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:33:13,464 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:33:13,464 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:33:13,464 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:33:13,464 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:33:13,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:33:13,465 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:33:13,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:33:13,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:33:13,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:33:13,465 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:33:13,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:33:13,465 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:33:13,465 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:33:13,465 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:33:13,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:33:13,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:33:13,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:33:13,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:33:13,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:33:13,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:33:13,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:33:13,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:33:13,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:33:13,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:33:13,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:33:13,466 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:33:13,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:33:13,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:33:13,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:33:13,467 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:33:13,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:33:13,467 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:33:13,467 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:33:13,467 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-jdk21/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 -> 8c9f77a5f5cfb41429e6b2e557580f5f8a855ca718c241fb5a07541ef3b21ab2 [2025-01-08 22:33:13,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:33:13,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:33:13,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:33:13,681 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:33:13,681 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:33:13,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array3_pattern.c [2025-01-08 22:33:14,827 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/027231c26/745e4c8467604eecb58381a71d8f3c66/FLAG28ef7ebbd [2025-01-08 22:33:15,042 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:33:15,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-patterns/array3_pattern.c [2025-01-08 22:33:15,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/027231c26/745e4c8467604eecb58381a71d8f3c66/FLAG28ef7ebbd [2025-01-08 22:33:15,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/027231c26/745e4c8467604eecb58381a71d8f3c66 [2025-01-08 22:33:15,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:33:15,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:33:15,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:33:15,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:33:15,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:33:15,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:33:15" (1/1) ... [2025-01-08 22:33:15,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@257ef43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:33:15, skipping insertion in model container [2025-01-08 22:33:15,109 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:33:15" (1/1) ... [2025-01-08 22:33:15,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:33:15,209 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-patterns/array3_pattern.c[1393,1406] [2025-01-08 22:33:15,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:33:15,228 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:33:15,234 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-patterns/array3_pattern.c[1393,1406] [2025-01-08 22:33:15,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:33:15,258 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:33:15,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:33:15 WrapperNode [2025-01-08 22:33:15,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:33:15,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:33:15,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:33:15,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:33:15,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:33:15" (1/1) ... [2025-01-08 22:33:15,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:33:15" (1/1) ... [2025-01-08 22:33:15,282 INFO L138 Inliner]: procedures = 17, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2025-01-08 22:33:15,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:33:15,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:33:15,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:33:15,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:33:15,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:33:15" (1/1) ... [2025-01-08 22:33:15,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:33:15" (1/1) ... [2025-01-08 22:33:15,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:33:15" (1/1) ... [2025-01-08 22:33:15,296 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 4, 4]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2025-01-08 22:33:15,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:33:15" (1/1) ... [2025-01-08 22:33:15,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:33:15" (1/1) ... [2025-01-08 22:33:15,300 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:33:15" (1/1) ... [2025-01-08 22:33:15,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:33:15" (1/1) ... [2025-01-08 22:33:15,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:33:15" (1/1) ... [2025-01-08 22:33:15,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:33:15" (1/1) ... [2025-01-08 22:33:15,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:33:15" (1/1) ... [2025-01-08 22:33:15,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:33:15,306 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:33:15,306 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:33:15,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:33:15,308 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:33:15" (1/1) ... [2025-01-08 22:33:15,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:33:15,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:33:15,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:33:15,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:33:15,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:33:15,346 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-08 22:33:15,346 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-08 22:33:15,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:33:15,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:33:15,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-08 22:33:15,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-08 22:33:15,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:33:15,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:33:15,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-08 22:33:15,346 INFO L130 BoogieDeclarations]: Found specification of procedure square [2025-01-08 22:33:15,346 INFO L138 BoogieDeclarations]: Found implementation of procedure square [2025-01-08 22:33:15,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:33:15,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:33:15,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:33:15,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:33:15,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-08 22:33:15,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-08 22:33:15,393 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:33:15,394 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:33:15,499 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-08 22:33:15,499 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:33:15,504 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:33:15,504 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:33:15,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:33:15 BoogieIcfgContainer [2025-01-08 22:33:15,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:33:15,506 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:33:15,506 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:33:15,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:33:15,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:33:15" (1/3) ... [2025-01-08 22:33:15,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56084bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:33:15, skipping insertion in model container [2025-01-08 22:33:15,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:33:15" (2/3) ... [2025-01-08 22:33:15,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56084bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:33:15, skipping insertion in model container [2025-01-08 22:33:15,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:33:15" (3/3) ... [2025-01-08 22:33:15,510 INFO L128 eAbstractionObserver]: Analyzing ICFG array3_pattern.c [2025-01-08 22:33:15,519 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:33:15,520 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array3_pattern.c that has 3 procedures, 29 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-08 22:33:15,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:33:15,563 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;@758a767d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:33:15,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:33:15,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-08 22:33:15,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-08 22:33:15,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:33:15,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:33:15,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:33:15,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:33:15,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1823891351, now seen corresponding path program 1 times [2025-01-08 22:33:15,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:33:15,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537175156] [2025-01-08 22:33:15,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:33:15,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:33:15,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-08 22:33:15,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-08 22:33:15,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:33:15,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:33:15,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:33:15,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:33:15,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537175156] [2025-01-08 22:33:15,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537175156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:33:15,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:33:15,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:33:15,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297658412] [2025-01-08 22:33:15,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:33:15,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-08 22:33:15,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:33:15,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-08 22:33:15,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-08 22:33:15,704 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-08 22:33:15,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:33:15,717 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2025-01-08 22:33:15,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-08 22:33:15,718 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-01-08 22:33:15,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:33:15,723 INFO L225 Difference]: With dead ends: 55 [2025-01-08 22:33:15,724 INFO L226 Difference]: Without dead ends: 25 [2025-01-08 22:33:15,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-08 22:33:15,731 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:33:15,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:33:15,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-08 22:33:15,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-01-08 22:33:15,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-08 22:33:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-01-08 22:33:15,759 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2025-01-08 22:33:15,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:33:15,759 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-01-08 22:33:15,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-08 22:33:15,760 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-01-08 22:33:15,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-08 22:33:15,761 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:33:15,761 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:33:15,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:33:15,761 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:33:15,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:33:15,762 INFO L85 PathProgramCache]: Analyzing trace with hash -35596760, now seen corresponding path program 1 times [2025-01-08 22:33:15,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:33:15,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353826880] [2025-01-08 22:33:15,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:33:15,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:33:15,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-08 22:33:15,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-08 22:33:15,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:33:15,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:33:16,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:33:16,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:33:16,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353826880] [2025-01-08 22:33:16,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353826880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:33:16,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:33:16,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:33:16,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896562267] [2025-01-08 22:33:16,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:33:16,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:33:16,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:33:16,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:33:16,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:33:16,024 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-08 22:33:16,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:33:16,042 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2025-01-08 22:33:16,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:33:16,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2025-01-08 22:33:16,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:33:16,044 INFO L225 Difference]: With dead ends: 31 [2025-01-08 22:33:16,044 INFO L226 Difference]: Without dead ends: 28 [2025-01-08 22:33:16,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:33:16,045 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:33:16,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:33:16,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-08 22:33:16,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-01-08 22:33:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-08 22:33:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-01-08 22:33:16,055 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 21 [2025-01-08 22:33:16,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:33:16,055 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-01-08 22:33:16,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-08 22:33:16,056 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-01-08 22:33:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-08 22:33:16,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:33:16,056 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:33:16,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:33:16,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:33:16,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:33:16,058 INFO L85 PathProgramCache]: Analyzing trace with hash -582925011, now seen corresponding path program 1 times [2025-01-08 22:33:16,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:33:16,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521039723] [2025-01-08 22:33:16,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:33:16,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:33:16,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-08 22:33:16,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-08 22:33:16,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:33:16,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:33:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-08 22:33:16,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:33:16,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521039723] [2025-01-08 22:33:16,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521039723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:33:16,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:33:16,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:33:16,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646948209] [2025-01-08 22:33:16,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:33:16,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:33:16,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:33:16,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:33:16,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:33:16,217 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-08 22:33:16,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:33:16,280 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2025-01-08 22:33:16,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:33:16,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2025-01-08 22:33:16,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:33:16,281 INFO L225 Difference]: With dead ends: 52 [2025-01-08 22:33:16,281 INFO L226 Difference]: Without dead ends: 31 [2025-01-08 22:33:16,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:33:16,282 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:33:16,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:33:16,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-08 22:33:16,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2025-01-08 22:33:16,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-08 22:33:16,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-01-08 22:33:16,289 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2025-01-08 22:33:16,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:33:16,289 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-01-08 22:33:16,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-08 22:33:16,289 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-01-08 22:33:16,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-08 22:33:16,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:33:16,290 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:33:16,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:33:16,291 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:33:16,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:33:16,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1879663353, now seen corresponding path program 1 times [2025-01-08 22:33:16,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:33:16,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028888472] [2025-01-08 22:33:16,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:33:16,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:33:16,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-08 22:33:16,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-08 22:33:16,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:33:16,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-08 22:33:16,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1003931428] [2025-01-08 22:33:16,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:33:16,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:33:16,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:33:16,336 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:33:16,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 22:33:16,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-08 22:33:16,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-08 22:33:16,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:33:16,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:33:16,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-01-08 22:33:16,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:33:16,550 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 11 treesize of output 7 [2025-01-08 22:33:16,562 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 11 treesize of output 7 [2025-01-08 22:33:16,871 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-01-08 22:33:16,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2025-01-08 22:33:16,893 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-01-08 22:33:16,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2025-01-08 22:33:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:33:17,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:33:19,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:33:19,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028888472] [2025-01-08 22:33:19,288 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-08 22:33:19,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003931428] [2025-01-08 22:33:19,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003931428] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:33:19,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:33:19,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2025-01-08 22:33:19,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909782567] [2025-01-08 22:33:19,289 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-08 22:33:19,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-08 22:33:19,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:33:19,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-08 22:33:19,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=928, Unknown=0, NotChecked=0, Total=1056 [2025-01-08 22:33:19,292 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 23 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 17 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-08 22:33:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:33:20,181 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2025-01-08 22:33:20,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-08 22:33:20,181 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 17 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2025-01-08 22:33:20,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:33:20,182 INFO L225 Difference]: With dead ends: 72 [2025-01-08 22:33:20,182 INFO L226 Difference]: Without dead ends: 69 [2025-01-08 22:33:20,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=335, Invalid=2017, Unknown=0, NotChecked=0, Total=2352 [2025-01-08 22:33:20,184 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 83 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:33:20,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 198 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:33:20,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-08 22:33:20,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2025-01-08 22:33:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-08 22:33:20,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2025-01-08 22:33:20,196 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 33 [2025-01-08 22:33:20,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:33:20,197 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2025-01-08 22:33:20,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 17 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-08 22:33:20,197 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2025-01-08 22:33:20,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-08 22:33:20,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:33:20,198 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:33:20,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 22:33:20,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:33:20,402 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:33:20,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:33:20,403 INFO L85 PathProgramCache]: Analyzing trace with hash 871121005, now seen corresponding path program 2 times [2025-01-08 22:33:20,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:33:20,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781610153] [2025-01-08 22:33:20,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:33:20,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:33:20,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-08 22:33:20,427 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-08 22:33:20,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:33:20,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:33:20,530 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-08 22:33:20,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:33:20,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781610153] [2025-01-08 22:33:20,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781610153] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:33:20,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347620564] [2025-01-08 22:33:20,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:33:20,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:33:20,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:33:20,532 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:33:20,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:33:20,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-08 22:33:20,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-08 22:33:20,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:33:20,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:33:20,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:33:20,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:33:20,644 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:33:20,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:33:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-08 22:33:20,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347620564] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:33:20,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:33:20,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-08 22:33:20,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299421310] [2025-01-08 22:33:20,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:33:20,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 22:33:20,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:33:20,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 22:33:20,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:33:20,696 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-01-08 22:33:20,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:33:20,842 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2025-01-08 22:33:20,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-08 22:33:20,842 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 34 [2025-01-08 22:33:20,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:33:20,843 INFO L225 Difference]: With dead ends: 70 [2025-01-08 22:33:20,843 INFO L226 Difference]: Without dead ends: 67 [2025-01-08 22:33:20,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-01-08 22:33:20,843 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 16 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:33:20,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 216 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:33:20,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-08 22:33:20,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2025-01-08 22:33:20,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-08 22:33:20,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2025-01-08 22:33:20,856 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 34 [2025-01-08 22:33:20,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:33:20,856 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2025-01-08 22:33:20,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-01-08 22:33:20,856 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2025-01-08 22:33:20,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-08 22:33:20,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:33:20,857 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:33:20,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 22:33:21,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:33:21,058 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:33:21,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:33:21,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1246573330, now seen corresponding path program 3 times [2025-01-08 22:33:21,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:33:21,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715905124] [2025-01-08 22:33:21,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:33:21,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:33:21,071 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-01-08 22:33:21,096 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 44 statements. [2025-01-08 22:33:21,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-08 22:33:21,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:33:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-08 22:33:21,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:33:21,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715905124] [2025-01-08 22:33:21,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715905124] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:33:21,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948050421] [2025-01-08 22:33:21,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:33:21,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:33:21,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:33:21,171 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:33:21,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 22:33:21,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-01-08 22:33:21,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 44 statements. [2025-01-08 22:33:21,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-08 22:33:21,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:33:21,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:33:21,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:33:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:33:21,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:33:21,334 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-08 22:33:21,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948050421] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:33:21,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:33:21,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-08 22:33:21,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243210358] [2025-01-08 22:33:21,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:33:21,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 22:33:21,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:33:21,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 22:33:21,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:33:21,336 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-01-08 22:33:21,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:33:21,405 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2025-01-08 22:33:21,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:33:21,405 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 44 [2025-01-08 22:33:21,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:33:21,406 INFO L225 Difference]: With dead ends: 70 [2025-01-08 22:33:21,406 INFO L226 Difference]: Without dead ends: 41 [2025-01-08 22:33:21,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:33:21,406 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:33:21,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 100 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:33:21,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-08 22:33:21,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2025-01-08 22:33:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-08 22:33:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-01-08 22:33:21,414 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 44 [2025-01-08 22:33:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:33:21,414 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-01-08 22:33:21,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-01-08 22:33:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-01-08 22:33:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-08 22:33:21,416 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:33:21,416 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:33:21,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 22:33:21,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:33:21,617 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:33:21,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:33:21,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1548669496, now seen corresponding path program 4 times [2025-01-08 22:33:21,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:33:21,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443613366] [2025-01-08 22:33:21,618 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:33:21,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:33:21,626 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-01-08 22:33:21,647 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-08 22:33:21,648 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:33:21,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-08 22:33:21,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1990300520] [2025-01-08 22:33:21,649 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:33:21,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:33:21,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:33:21,651 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:33:21,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 22:33:21,686 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-01-08 22:33:21,793 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-08 22:33:21,793 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:33:21,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:33:21,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-01-08 22:33:21,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:33:21,845 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 11 treesize of output 7 [2025-01-08 22:33:21,850 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 11 treesize of output 7 [2025-01-08 22:33:21,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-08 22:33:21,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-08 22:33:22,260 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-01-08 22:33:22,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 123 [2025-01-08 22:33:22,334 INFO L349 Elim1Store]: treesize reduction 133, result has 23.1 percent of original size [2025-01-08 22:33:22,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 50 treesize of output 63 [2025-01-08 22:33:22,380 INFO L349 Elim1Store]: treesize reduction 94, result has 1.1 percent of original size [2025-01-08 22:33:22,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 157 [2025-01-08 22:33:24,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:33:24,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 347 treesize of output 363 [2025-01-08 22:33:26,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:33:26,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 897 treesize of output 1235 [2025-01-08 22:33:28,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:33:28,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 317 treesize of output 281 [2025-01-08 22:33:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:33:28,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:33:36,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:33:36,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443613366] [2025-01-08 22:33:36,554 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-08 22:33:36,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990300520] [2025-01-08 22:33:36,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990300520] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:33:36,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:33:36,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2025-01-08 22:33:36,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735479682] [2025-01-08 22:33:36,554 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-08 22:33:36,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-08 22:33:36,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:33:36,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-08 22:33:36,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1616, Unknown=0, NotChecked=0, Total=1806 [2025-01-08 22:33:36,558 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 21 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-08 22:33:44,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:33:44,739 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2025-01-08 22:33:44,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-08 22:33:44,739 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 1.24) internal successors, (31), 21 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 45 [2025-01-08 22:33:44,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:33:44,740 INFO L225 Difference]: With dead ends: 92 [2025-01-08 22:33:44,741 INFO L226 Difference]: Without dead ends: 89 [2025-01-08 22:33:44,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=425, Invalid=3115, Unknown=0, NotChecked=0, Total=3540 [2025-01-08 22:33:44,742 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 75 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:33:44,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 278 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 22:33:44,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-08 22:33:44,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 66. [2025-01-08 22:33:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-08 22:33:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2025-01-08 22:33:44,760 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 45 [2025-01-08 22:33:44,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:33:44,760 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2025-01-08 22:33:44,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 1.24) internal successors, (31), 21 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-08 22:33:44,760 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2025-01-08 22:33:44,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-08 22:33:44,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:33:44,763 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:33:44,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-08 22:33:44,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-01-08 22:33:44,964 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:33:44,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:33:44,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1971251246, now seen corresponding path program 5 times [2025-01-08 22:33:44,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:33:44,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865492467] [2025-01-08 22:33:44,964 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:33:44,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:33:44,970 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 46 statements into 4 equivalence classes. [2025-01-08 22:33:44,979 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 46 of 46 statements. [2025-01-08 22:33:44,979 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-08 22:33:44,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:33:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-08 22:33:45,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:33:45,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865492467] [2025-01-08 22:33:45,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865492467] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:33:45,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341925331] [2025-01-08 22:33:45,080 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:33:45,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:33:45,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:33:45,082 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:33:45,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-08 22:33:45,121 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 46 statements into 4 equivalence classes. [2025-01-08 22:33:45,148 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 46 of 46 statements. [2025-01-08 22:33:45,148 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-08 22:33:45,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:33:45,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:33:45,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:33:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-08 22:33:45,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:33:45,279 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-08 22:33:45,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341925331] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:33:45,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:33:45,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-01-08 22:33:45,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460530193] [2025-01-08 22:33:45,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:33:45,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-08 22:33:45,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:33:45,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-08 22:33:45,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:33:45,280 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-01-08 22:33:45,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:33:45,463 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2025-01-08 22:33:45,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-08 22:33:45,463 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 46 [2025-01-08 22:33:45,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:33:45,464 INFO L225 Difference]: With dead ends: 107 [2025-01-08 22:33:45,464 INFO L226 Difference]: Without dead ends: 104 [2025-01-08 22:33:45,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2025-01-08 22:33:45,465 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:33:45,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 246 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:33:45,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-08 22:33:45,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2025-01-08 22:33:45,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.106060606060606) internal successors, (73), 67 states have internal predecessors, (73), 20 states have call successors, (20), 8 states have call predecessors, (20), 8 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-08 22:33:45,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2025-01-08 22:33:45,485 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 46 [2025-01-08 22:33:45,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:33:45,486 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 113 transitions. [2025-01-08 22:33:45,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-01-08 22:33:45,486 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2025-01-08 22:33:45,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-08 22:33:45,486 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:33:45,486 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:33:45,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-08 22:33:45,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:33:45,687 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:33:45,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:33:45,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1590380594, now seen corresponding path program 1 times [2025-01-08 22:33:45,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:33:45,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496554681] [2025-01-08 22:33:45,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:33:45,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:33:45,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-08 22:33:45,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-08 22:33:45,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:33:45,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-08 22:33:45,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1835141504] [2025-01-08 22:33:45,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:33:45,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:33:45,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:33:45,757 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:33:45,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-08 22:33:45,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-08 22:33:46,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-08 22:33:46,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:33:46,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:33:46,023 WARN L254 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 112 conjuncts are in the unsatisfiable core [2025-01-08 22:33:46,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:33:46,086 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 11 treesize of output 7 [2025-01-08 22:33:46,098 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 11 treesize of output 7 [2025-01-08 22:33:46,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-08 22:33:46,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-08 22:33:46,434 INFO L349 Elim1Store]: treesize reduction 133, result has 23.1 percent of original size [2025-01-08 22:33:46,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 50 treesize of output 63 [2025-01-08 22:33:46,460 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-01-08 22:33:46,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 123 [2025-01-08 22:33:46,503 INFO L349 Elim1Store]: treesize reduction 94, result has 1.1 percent of original size [2025-01-08 22:33:46,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 157 [2025-01-08 22:33:46,527 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-08 22:33:47,785 INFO L349 Elim1Store]: treesize reduction 208, result has 29.5 percent of original size [2025-01-08 22:33:47,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 361 treesize of output 409 [2025-01-08 22:33:48,028 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2025-01-08 22:33:48,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 418 treesize of output 404