./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array10_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/array10_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 0942a0394519a722254bfe5a1820a904a71ba1b47e3e66c2c8dc2abe6585692f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:20:24,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:20:24,491 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:20:24,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:20:24,497 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:20:24,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:20:24,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:20:24,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:20:24,518 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:20:24,518 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:20:24,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:20:24,519 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:20:24,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:20:24,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:20:24,519 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:20:24,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:20:24,520 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:20:24,520 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:20:24,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:20:24,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:20:24,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:20:24,520 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:20:24,520 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:20:24,520 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:20:24,520 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:20:24,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:20:24,520 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:20:24,520 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:20:24,521 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:20:24,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:20:24,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:20:24,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:20:24,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:20:24,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:20:24,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:20:24,521 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:20:24,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:20:24,522 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:20:24,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:20:24,522 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:20:24,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:20:24,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:20:24,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:20:24,522 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 -> 0942a0394519a722254bfe5a1820a904a71ba1b47e3e66c2c8dc2abe6585692f [2025-02-05 10:20:24,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:20:24,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:20:24,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:20:24,731 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:20:24,731 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:20:24,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array10_pattern.c [2025-02-05 10:20:25,828 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24481e8b7/11905e6085f54bd1a80e69a6dc8e3481/FLAG37d438a37 [2025-02-05 10:20:26,087 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:20:26,088 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-patterns/array10_pattern.c [2025-02-05 10:20:26,118 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24481e8b7/11905e6085f54bd1a80e69a6dc8e3481/FLAG37d438a37 [2025-02-05 10:20:26,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24481e8b7/11905e6085f54bd1a80e69a6dc8e3481 [2025-02-05 10:20:26,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:20:26,139 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:20:26,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:20:26,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:20:26,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:20:26,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:20:26" (1/1) ... [2025-02-05 10:20:26,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa3d139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:26, skipping insertion in model container [2025-02-05 10:20:26,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:20:26" (1/1) ... [2025-02-05 10:20:26,157 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:20:26,256 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/array10_pattern.c[1326,1339] [2025-02-05 10:20:26,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:20:26,284 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:20:26,291 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/array10_pattern.c[1326,1339] [2025-02-05 10:20:26,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:20:26,311 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:20:26,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:26 WrapperNode [2025-02-05 10:20:26,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:20:26,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:20:26,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:20:26,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:20:26,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:26" (1/1) ... [2025-02-05 10:20:26,323 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:26" (1/1) ... [2025-02-05 10:20:26,341 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2025-02-05 10:20:26,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:20:26,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:20:26,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:20:26,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:20:26,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:26" (1/1) ... [2025-02-05 10:20:26,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:26" (1/1) ... [2025-02-05 10:20:26,352 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:26" (1/1) ... [2025-02-05 10:20:26,370 INFO L175 MemorySlicer]: Split 9 memory accesses to 3 slices as follows [2, 4, 3]. 44 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-02-05 10:20:26,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:26" (1/1) ... [2025-02-05 10:20:26,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:26" (1/1) ... [2025-02-05 10:20:26,375 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:26" (1/1) ... [2025-02-05 10:20:26,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:26" (1/1) ... [2025-02-05 10:20:26,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:26" (1/1) ... [2025-02-05 10:20:26,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:26" (1/1) ... [2025-02-05 10:20:26,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:20:26,380 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:20:26,380 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:20:26,380 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:20:26,381 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:26" (1/1) ... [2025-02-05 10:20:26,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:20:26,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:20:26,403 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-02-05 10:20:26,405 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-02-05 10:20:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:20:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 10:20:26,420 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 10:20:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:20:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 10:20:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 10:20:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 10:20:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 10:20:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 10:20:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 10:20:26,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:20:26,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:20:26,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 10:20:26,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 10:20:26,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 10:20:26,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 10:20:26,464 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:20:26,466 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:20:26,577 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L44: call ULTIMATE.dealloc(main_~#array1~0#1.base, main_~#array1~0#1.offset);havoc main_~#array1~0#1.base, main_~#array1~0#1.offset;call ULTIMATE.dealloc(main_~#array2~0#1.base, main_~#array2~0#1.offset);havoc main_~#array2~0#1.base, main_~#array2~0#1.offset; [2025-02-05 10:20:26,592 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-02-05 10:20:26,592 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:20:26,602 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:20:26,605 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:20:26,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:20:26 BoogieIcfgContainer [2025-02-05 10:20:26,606 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:20:26,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:20:26,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:20:26,614 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:20:26,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:20:26" (1/3) ... [2025-02-05 10:20:26,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9c4eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:20:26, skipping insertion in model container [2025-02-05 10:20:26,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:26" (2/3) ... [2025-02-05 10:20:26,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9c4eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:20:26, skipping insertion in model container [2025-02-05 10:20:26,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:20:26" (3/3) ... [2025-02-05 10:20:26,615 INFO L128 eAbstractionObserver]: Analyzing ICFG array10_pattern.c [2025-02-05 10:20:26,635 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:20:26,636 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array10_pattern.c that has 2 procedures, 24 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-05 10:20:26,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:20:26,688 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;@1cd9873a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:20:26,688 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:20:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 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-02-05 10:20:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 10:20:26,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:20:26,695 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:20:26,696 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:20:26,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:20:26,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1108002039, now seen corresponding path program 1 times [2025-02-05 10:20:26,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:20:26,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513057183] [2025-02-05 10:20:26,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:20:26,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:20:26,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 10:20:26,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 10:20:26,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:20:26,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:20:26,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:20:26,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513057183] [2025-02-05 10:20:26,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513057183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:20:26,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:20:26,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:20:26,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308418017] [2025-02-05 10:20:26,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:20:26,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 10:20:26,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:20:26,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 10:20:26,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 10:20:26,831 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 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) 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-02-05 10:20:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:20:26,841 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2025-02-05 10:20:26,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 10:20:26,842 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-02-05 10:20:26,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:20:26,845 INFO L225 Difference]: With dead ends: 45 [2025-02-05 10:20:26,849 INFO L226 Difference]: Without dead ends: 20 [2025-02-05 10:20:26,851 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-02-05 10:20:26,855 INFO L435 NwaCegarLoop]: 28 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, 28 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-02-05 10:20:26,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:20:26,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-05 10:20:26,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-05 10:20:26,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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-02-05 10:20:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-02-05 10:20:26,880 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2025-02-05 10:20:26,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:20:26,880 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-02-05 10:20:26,881 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-02-05 10:20:26,881 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-02-05 10:20:26,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 10:20:26,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:20:26,883 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:20:26,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:20:26,884 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:20:26,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:20:26,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1387027740, now seen corresponding path program 1 times [2025-02-05 10:20:26,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:20:26,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362479380] [2025-02-05 10:20:26,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:20:26,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:20:26,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 10:20:26,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 10:20:26,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:20:26,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:20:27,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:20:27,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362479380] [2025-02-05 10:20:27,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362479380] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:20:27,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623053380] [2025-02-05 10:20:27,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:20:27,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:20:27,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:20:27,184 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-02-05 10:20:27,188 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-02-05 10:20:27,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 10:20:27,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 10:20:27,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:20:27,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:27,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 10:20:27,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:20:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:20:27,326 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:20:27,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623053380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:20:27,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:20:27,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-02-05 10:20:27,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722926262] [2025-02-05 10:20:27,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:20:27,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:20:27,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:20:27,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:20:27,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:20:27,328 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 10:20:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:20:27,377 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2025-02-05 10:20:27,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:20:27,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-02-05 10:20:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:20:27,379 INFO L225 Difference]: With dead ends: 46 [2025-02-05 10:20:27,379 INFO L226 Difference]: Without dead ends: 25 [2025-02-05 10:20:27,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:20:27,380 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:20:27,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 83 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:20:27,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-05 10:20:27,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2025-02-05 10:20:27,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-02-05 10:20:27,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-02-05 10:20:27,387 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 23 [2025-02-05 10:20:27,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:20:27,387 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-02-05 10:20:27,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 10:20:27,388 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-02-05 10:20:27,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 10:20:27,389 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:20:27,389 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:20:27,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 10:20:27,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:20:27,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:20:27,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:20:27,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1876442842, now seen corresponding path program 1 times [2025-02-05 10:20:27,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:20:27,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535102393] [2025-02-05 10:20:27,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:20:27,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:20:27,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:20:27,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:20:27,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:20:27,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:27,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 10:20:27,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:20:27,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535102393] [2025-02-05 10:20:27,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535102393] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:20:27,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191909186] [2025-02-05 10:20:27,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:20:27,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:20:27,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:20:27,711 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-02-05 10:20:27,712 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-02-05 10:20:27,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:20:27,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:20:27,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:20:27,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:27,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:20:27,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:20:27,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:20:27,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:20:27,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 10:20:27,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191909186] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:20:27,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:20:27,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-05 10:20:27,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438942865] [2025-02-05 10:20:27,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:20:27,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 10:20:27,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:20:27,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 10:20:27,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:20:27,836 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:20:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:20:27,881 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2025-02-05 10:20:27,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:20:27,881 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2025-02-05 10:20:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:20:27,882 INFO L225 Difference]: With dead ends: 29 [2025-02-05 10:20:27,882 INFO L226 Difference]: Without dead ends: 26 [2025-02-05 10:20:27,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:20:27,883 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:20:27,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 76 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:20:27,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-05 10:20:27,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-02-05 10:20:27,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 10:20:27,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-02-05 10:20:27,889 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 24 [2025-02-05 10:20:27,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:20:27,889 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-02-05 10:20:27,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:20:27,889 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-02-05 10:20:27,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 10:20:27,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:20:27,889 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:20:27,895 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-02-05 10:20:28,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:20:28,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:20:28,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:20:28,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1959782289, now seen corresponding path program 1 times [2025-02-05 10:20:28,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:20:28,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671307467] [2025-02-05 10:20:28,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:20:28,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:20:28,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 10:20:28,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 10:20:28,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:20:28,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:28,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:20:28,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:20:28,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671307467] [2025-02-05 10:20:28,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671307467] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:20:28,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877046118] [2025-02-05 10:20:28,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:20:28,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:20:28,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:20:28,424 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-02-05 10:20:28,425 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-02-05 10:20:28,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 10:20:28,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 10:20:28,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:20:28,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:28,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 10:20:28,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:20:28,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:20:28,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:20:28,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:20:28,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877046118] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:20:28,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:20:28,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-02-05 10:20:28,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121394022] [2025-02-05 10:20:28,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:20:28,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 10:20:28,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:20:28,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 10:20:28,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-02-05 10:20:28,725 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 18 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 10:20:28,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:20:28,877 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2025-02-05 10:20:28,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 10:20:28,878 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 18 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2025-02-05 10:20:28,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:20:28,878 INFO L225 Difference]: With dead ends: 61 [2025-02-05 10:20:28,878 INFO L226 Difference]: Without dead ends: 45 [2025-02-05 10:20:28,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2025-02-05 10:20:28,879 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:20:28,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 149 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:20:28,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-05 10:20:28,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2025-02-05 10:20:28,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 10:20:28,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-02-05 10:20:28,883 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 25 [2025-02-05 10:20:28,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:20:28,883 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-02-05 10:20:28,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 18 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 10:20:28,884 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-02-05 10:20:28,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 10:20:28,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:20:28,884 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:20:28,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 10:20:29,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:20:29,085 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:20:29,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:20:29,086 INFO L85 PathProgramCache]: Analyzing trace with hash -216971954, now seen corresponding path program 1 times [2025-02-05 10:20:29,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:20:29,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310084263] [2025-02-05 10:20:29,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:20:29,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:20:29,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 10:20:29,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 10:20:29,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:20:29,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 10:20:29,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [482101887] [2025-02-05 10:20:29,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:20:29,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:20:29,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:20:29,110 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-02-05 10:20:29,112 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-02-05 10:20:29,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 10:20:29,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 10:20:29,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:20:29,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:29,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-05 10:20:29,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:20:29,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:20:29,250 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-02-05 10:20:29,499 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-02-05 10:20:29,500 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-02-05 10:20:29,618 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-02-05 10:20:29,618 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-02-05 10:20:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:20:29,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:21:01,364 WARN L286 SmtUtils]: Spent 26.79s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-05 10:21:17,446 WARN L286 SmtUtils]: Spent 16.08s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-05 10:21:37,627 WARN L286 SmtUtils]: Spent 20.18s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-05 10:21:41,890 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse13 (mod |c_ULTIMATE.start_main_~index~0#1| 4294967296))) (let ((.cse14 (* .cse13 4))) (let ((.cse12 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse15 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse14))) (let ((.cse8 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse4 (* |c_ULTIMATE.start_main_~sum~0#1| 4)) (.cse5 (* c_~ARR_SIZE~0 c_~ARR_SIZE~0)) (.cse16 (mod (select .cse12 .cse15) 4294967296))) (let ((.cse10 (< 2147483647 .cse13)) (.cse7 (* (select (store .cse12 .cse15 (+ .cse16 (- 4294967296))) |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4)) (.cse6 (< 2147483647 .cse16)) (.cse3 (* (select (store .cse12 .cse15 .cse16) |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4)) (.cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse14)) (.cse0 (mod (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse1 (or (< (+ (* (select .cse8 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse4 (* (select .cse12 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4)) .cse5) (< .cse13 2147483648)))) (and (or (< .cse0 2147483648) (and .cse1 (or (let ((.cse2 (* (select (store .cse8 .cse9 (+ .cse0 (- 4294967296))) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) (and (or (< (+ .cse2 .cse3 .cse4) .cse5) .cse6) (<= (+ .cse2 .cse4 .cse7 1) .cse5))) .cse10))) (or (< 2147483647 .cse0) (and (or .cse10 (let ((.cse11 (* (select (store .cse8 .cse9 .cse0) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) (and (<= (+ .cse11 .cse4 .cse7 1) .cse5) (or .cse6 (< (+ .cse11 .cse3 .cse4) .cse5))))) .cse1)))))))) is different from true [2025-02-05 10:21:49,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:21:49,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310084263] [2025-02-05 10:21:49,357 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 10:21:49,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482101887] [2025-02-05 10:21:49,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482101887] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:21:49,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:21:49,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2025-02-05 10:21:49,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434100261] [2025-02-05 10:21:49,357 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 10:21:49,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 10:21:49,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:21:49,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 10:21:49,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=484, Unknown=2, NotChecked=46, Total=650 [2025-02-05 10:21:49,361 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 10:21:50,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:21:50,070 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2025-02-05 10:21:50,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 10:21:50,070 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-02-05 10:21:50,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:21:50,071 INFO L225 Difference]: With dead ends: 47 [2025-02-05 10:21:50,071 INFO L226 Difference]: Without dead ends: 44 [2025-02-05 10:21:50,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=177, Invalid=755, Unknown=2, NotChecked=58, Total=992 [2025-02-05 10:21:50,072 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 30 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:21:50,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 140 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:21:50,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-05 10:21:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2025-02-05 10:21:50,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 10:21:50,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-02-05 10:21:50,081 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 25 [2025-02-05 10:21:50,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:21:50,081 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-02-05 10:21:50,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 10:21:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-02-05 10:21:50,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 10:21:50,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:21:50,081 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:21:50,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 10:21:50,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:21:50,282 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:21:50,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:21:50,282 INFO L85 PathProgramCache]: Analyzing trace with hash 216695469, now seen corresponding path program 2 times [2025-02-05 10:21:50,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:21:50,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281003716] [2025-02-05 10:21:50,282 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:21:50,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:21:50,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-05 10:21:50,301 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 10:21:50,305 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:21:50,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:21:50,406 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 10:21:50,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:21:50,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281003716] [2025-02-05 10:21:50,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281003716] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:21:50,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319670628] [2025-02-05 10:21:50,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:21:50,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:21:50,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:21:50,410 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-02-05 10:21:50,413 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-02-05 10:21:50,443 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-05 10:21:50,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 10:21:50,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:21:50,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:21:50,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 10:21:50,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:21:50,569 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:21:50,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:21:50,699 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 10:21:50,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319670628] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:21:50,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:21:50,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-05 10:21:50,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591713410] [2025-02-05 10:21:50,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:21:50,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 10:21:50,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:21:50,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 10:21:50,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:21:50,701 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:21:50,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:21:50,802 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-02-05 10:21:50,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 10:21:50,802 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-02-05 10:21:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:21:50,803 INFO L225 Difference]: With dead ends: 44 [2025-02-05 10:21:50,803 INFO L226 Difference]: Without dead ends: 41 [2025-02-05 10:21:50,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-02-05 10:21:50,803 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:21:50,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 92 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:21:50,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-05 10:21:50,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2025-02-05 10:21:50,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 10:21:50,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-02-05 10:21:50,808 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 26 [2025-02-05 10:21:50,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:21:50,808 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-02-05 10:21:50,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:21:50,808 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-02-05 10:21:50,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 10:21:50,809 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:21:50,809 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:21:50,817 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-02-05 10:21:51,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:21:51,009 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:21:51,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:21:51,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1863835771, now seen corresponding path program 2 times [2025-02-05 10:21:51,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:21:51,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971974366] [2025-02-05 10:21:51,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:21:51,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:21:51,014 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-05 10:21:51,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 10:21:51,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:21:51,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:21:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 10:21:51,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:21:51,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971974366] [2025-02-05 10:21:51,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971974366] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:21:51,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441238801] [2025-02-05 10:21:51,106 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:21:51,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:21:51,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:21:51,109 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-02-05 10:21:51,110 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-02-05 10:21:51,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-05 10:21:51,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 10:21:51,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:21:51,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:21:51,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 10:21:51,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:21:51,279 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:21:51,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:21:51,385 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 10:21:51,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441238801] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:21:51,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:21:51,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-05 10:21:51,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401578852] [2025-02-05 10:21:51,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:21:51,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 10:21:51,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:21:51,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 10:21:51,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:21:51,386 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:21:51,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:21:51,518 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2025-02-05 10:21:51,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:21:51,519 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-02-05 10:21:51,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:21:51,519 INFO L225 Difference]: With dead ends: 45 [2025-02-05 10:21:51,519 INFO L226 Difference]: Without dead ends: 28 [2025-02-05 10:21:51,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 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-02-05 10:21:51,520 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:21:51,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 115 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:21:51,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-05 10:21:51,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-05 10:21:51,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 10:21:51,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2025-02-05 10:21:51,524 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 26 [2025-02-05 10:21:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:21:51,524 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-02-05 10:21:51,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:21:51,524 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2025-02-05 10:21:51,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 10:21:51,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:21:51,524 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] [2025-02-05 10:21:51,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 10:21:51,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-05 10:21:51,725 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:21:51,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:21:51,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1872343300, now seen corresponding path program 3 times [2025-02-05 10:21:51,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:21:51,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122638428] [2025-02-05 10:21:51,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:21:51,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:21:51,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-02-05 10:21:51,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:21:51,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 10:21:51,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 10:21:51,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1756438345] [2025-02-05 10:21:51,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:21:51,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:21:51,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:21:51,776 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:21:51,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 10:21:51,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-02-05 10:21:51,845 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:21:51,845 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 10:21:51,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:21:51,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-05 10:21:51,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:21:51,968 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-02-05 10:21:51,980 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-02-05 10:21:52,034 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-02-05 10:21:52,046 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-02-05 10:21:52,792 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-02-05 10:21:52,792 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 86 treesize of output 83 [2025-02-05 10:21:52,841 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2025-02-05 10:21:52,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 99 [2025-02-05 10:21:53,482 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-02-05 10:21:53,483 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 88 treesize of output 85 [2025-02-05 10:21:53,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:53,603 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-02-05 10:21:53,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 114 [2025-02-05 10:21:53,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:53,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:53,737 INFO L349 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2025-02-05 10:21:53,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 28 [2025-02-05 10:21:56,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 355 treesize of output 341 [2025-02-05 10:21:56,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:21:56,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 527 treesize of output 545 [2025-02-05 10:21:56,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:21:56,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 301 treesize of output 298 [2025-02-05 10:21:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:21:57,265 INFO L312 TraceCheckSpWp]: Computing backward predicates...