./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/pr3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/pr3.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 73efddcda095c52d9900d13088d1ec70520de6007541f46343a568e878cf2ed4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:18:16,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:18:16,139 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:18:16,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:18:16,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:18:16,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:18:16,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:18:16,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:18:16,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:18:16,156 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:18:16,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:18:16,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:18:16,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:18:16,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:18:16,156 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:18:16,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:18:16,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:18:16,157 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:18:16,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:18:16,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:18:16,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:18:16,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:18:16,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:18:16,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:18:16,161 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:18:16,161 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:18:16,161 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:18:16,161 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:18:16,161 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:18:16,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:18:16,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:18:16,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:18:16,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:18:16,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:18:16,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:18:16,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:18:16,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:18:16,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:18:16,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:18:16,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:18:16,162 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:18:16,162 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:18:16,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:18:16,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:18:16,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:18:16,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:18:16,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:18:16,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:18:16,162 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 -> 73efddcda095c52d9900d13088d1ec70520de6007541f46343a568e878cf2ed4 [2025-01-08 22:18:16,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:18:16,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:18:16,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:18:16,319 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:18:16,319 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:18:16,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/pr3.c [2025-01-08 22:18:17,397 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c394f4d75/68b4eb0a8af3463b8f43a5c22714adea/FLAG39f587694 [2025-01-08 22:18:17,622 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:18:17,622 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/pr3.c [2025-01-08 22:18:17,627 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c394f4d75/68b4eb0a8af3463b8f43a5c22714adea/FLAG39f587694 [2025-01-08 22:18:17,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c394f4d75/68b4eb0a8af3463b8f43a5c22714adea [2025-01-08 22:18:17,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:18:17,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:18:17,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:18:17,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:18:17,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:18:17,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:18:17" (1/1) ... [2025-01-08 22:18:17,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@310ad48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:17, skipping insertion in model container [2025-01-08 22:18:17,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:18:17" (1/1) ... [2025-01-08 22:18:17,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:18:18,079 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-tiling/pr3.c[394,407] [2025-01-08 22:18:18,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:18:18,102 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:18:18,112 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-tiling/pr3.c[394,407] [2025-01-08 22:18:18,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:18:18,133 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:18:18,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:18 WrapperNode [2025-01-08 22:18:18,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:18:18,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:18:18,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:18:18,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:18:18,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:18" (1/1) ... [2025-01-08 22:18:18,151 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:18" (1/1) ... [2025-01-08 22:18:18,164 INFO L138 Inliner]: procedures = 15, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2025-01-08 22:18:18,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:18:18,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:18:18,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:18:18,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:18:18,175 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:18" (1/1) ... [2025-01-08 22:18:18,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:18" (1/1) ... [2025-01-08 22:18:18,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:18" (1/1) ... [2025-01-08 22:18:18,188 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 6, 8]. 50 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 6 writes are split as follows [0, 0, 6]. [2025-01-08 22:18:18,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:18" (1/1) ... [2025-01-08 22:18:18,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:18" (1/1) ... [2025-01-08 22:18:18,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:18" (1/1) ... [2025-01-08 22:18:18,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:18" (1/1) ... [2025-01-08 22:18:18,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:18" (1/1) ... [2025-01-08 22:18:18,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:18" (1/1) ... [2025-01-08 22:18:18,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:18" (1/1) ... [2025-01-08 22:18:18,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:18:18,196 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:18:18,196 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:18:18,196 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:18:18,197 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:18" (1/1) ... [2025-01-08 22:18:18,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:18:18,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:18:18,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:18:18,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:18:18,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:18:18,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:18:18,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:18:18,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-08 22:18:18,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-08 22:18:18,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:18:18,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:18:18,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-08 22:18:18,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:18:18,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:18:18,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:18:18,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:18:18,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-08 22:18:18,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-08 22:18:18,310 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:18:18,311 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:18:18,415 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-08 22:18:18,415 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:18:18,425 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:18:18,425 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:18:18,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:18:18 BoogieIcfgContainer [2025-01-08 22:18:18,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:18:18,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:18:18,427 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:18:18,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:18:18,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:18:17" (1/3) ... [2025-01-08 22:18:18,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1daa5f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:18:18, skipping insertion in model container [2025-01-08 22:18:18,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:18" (2/3) ... [2025-01-08 22:18:18,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1daa5f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:18:18, skipping insertion in model container [2025-01-08 22:18:18,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:18:18" (3/3) ... [2025-01-08 22:18:18,432 INFO L128 eAbstractionObserver]: Analyzing ICFG pr3.c [2025-01-08 22:18:18,441 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:18:18,442 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pr3.c that has 1 procedures, 22 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-08 22:18:18,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:18:18,477 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;@2d91c787, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:18:18,477 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:18:18,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:18,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-08 22:18:18,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:18:18,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:18:18,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:18:18,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:18:18,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1133771338, now seen corresponding path program 1 times [2025-01-08 22:18:18,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:18:18,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152601094] [2025-01-08 22:18:18,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:18:18,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:18:18,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-08 22:18:18,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-08 22:18:18,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:18:18,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:18,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:18,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:18:18,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152601094] [2025-01-08 22:18:18,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152601094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:18:18,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:18:18,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:18:18,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666053037] [2025-01-08 22:18:18,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:18:18,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-08 22:18:18,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:18:18,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-08 22:18:18,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-08 22:18:18,597 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:18:18,603 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2025-01-08 22:18:18,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-08 22:18:18,604 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-08 22:18:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:18:18,608 INFO L225 Difference]: With dead ends: 39 [2025-01-08 22:18:18,608 INFO L226 Difference]: Without dead ends: 18 [2025-01-08 22:18:18,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-08 22:18:18,611 INFO L435 NwaCegarLoop]: 29 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, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:18:18,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:18:18,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-01-08 22:18:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-01-08 22:18:18,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2025-01-08 22:18:18,632 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 12 [2025-01-08 22:18:18,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:18:18,633 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-01-08 22:18:18,633 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2025-01-08 22:18:18,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-08 22:18:18,634 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:18:18,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:18:18,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:18:18,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:18:18,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:18:18,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1943117964, now seen corresponding path program 1 times [2025-01-08 22:18:18,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:18:18,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557718522] [2025-01-08 22:18:18,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:18:18,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:18:18,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-08 22:18:18,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-08 22:18:18,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:18:18,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:18,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:18:18,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557718522] [2025-01-08 22:18:18,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557718522] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:18:18,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:18:18,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:18:18,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400070892] [2025-01-08 22:18:18,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:18:18,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:18:18,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:18:18,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:18:18,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:18:18,800 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:18,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:18:18,822 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2025-01-08 22:18:18,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:18:18,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-08 22:18:18,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:18:18,823 INFO L225 Difference]: With dead ends: 22 [2025-01-08 22:18:18,823 INFO L226 Difference]: Without dead ends: 20 [2025-01-08 22:18:18,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:18:18,825 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:18:18,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:18:18,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-01-08 22:18:18,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-01-08 22:18:18,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-01-08 22:18:18,828 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2025-01-08 22:18:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:18:18,828 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-01-08 22:18:18,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:18,828 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-01-08 22:18:18,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-08 22:18:18,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:18:18,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:18:18,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:18:18,828 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:18:18,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:18:18,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1943058382, now seen corresponding path program 1 times [2025-01-08 22:18:18,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:18:18,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463163818] [2025-01-08 22:18:18,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:18:18,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:18:18,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-08 22:18:18,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-08 22:18:18,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:18:18,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:19,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:18:19,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463163818] [2025-01-08 22:18:19,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463163818] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:18:19,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:18:19,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:18:19,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305865234] [2025-01-08 22:18:19,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:18:19,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:18:19,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:18:19,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:18:19,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:18:19,044 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:19,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:18:19,100 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2025-01-08 22:18:19,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:18:19,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-08 22:18:19,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:18:19,102 INFO L225 Difference]: With dead ends: 34 [2025-01-08 22:18:19,102 INFO L226 Difference]: Without dead ends: 25 [2025-01-08 22:18:19,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:18:19,103 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:18:19,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 18 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:18:19,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-08 22:18:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2025-01-08 22:18:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-01-08 22:18:19,108 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2025-01-08 22:18:19,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:18:19,108 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-01-08 22:18:19,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:19,108 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2025-01-08 22:18:19,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-08 22:18:19,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:18:19,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:18:19,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:18:19,109 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:18:19,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:18:19,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1749312703, now seen corresponding path program 1 times [2025-01-08 22:18:19,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:18:19,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18510483] [2025-01-08 22:18:19,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:18:19,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:18:19,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-08 22:18:19,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-08 22:18:19,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:18:19,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:19,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:18:19,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18510483] [2025-01-08 22:18:19,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18510483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:18:19,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:18:19,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:18:19,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105049917] [2025-01-08 22:18:19,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:18:19,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:18:19,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:18:19,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:18:19,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:18:19,216 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:19,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:18:19,244 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2025-01-08 22:18:19,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:18:19,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-08 22:18:19,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:18:19,245 INFO L225 Difference]: With dead ends: 49 [2025-01-08 22:18:19,245 INFO L226 Difference]: Without dead ends: 35 [2025-01-08 22:18:19,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:18:19,245 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:18:19,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:18:19,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-08 22:18:19,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2025-01-08 22:18:19,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:19,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2025-01-08 22:18:19,248 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 17 [2025-01-08 22:18:19,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:18:19,249 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2025-01-08 22:18:19,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:19,249 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2025-01-08 22:18:19,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-08 22:18:19,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:18:19,249 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:18:19,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:18:19,249 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:18:19,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:18:19,250 INFO L85 PathProgramCache]: Analyzing trace with hash 939966077, now seen corresponding path program 1 times [2025-01-08 22:18:19,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:18:19,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676270972] [2025-01-08 22:18:19,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:18:19,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:18:19,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-08 22:18:19,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-08 22:18:19,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:18:19,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:19,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:18:19,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676270972] [2025-01-08 22:18:19,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676270972] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:18:19,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451829081] [2025-01-08 22:18:19,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:18:19,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:18:19,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:18:19,489 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:18:19,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 22:18:19,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-08 22:18:19,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-08 22:18:19,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:18:19,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:19,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-08 22:18:19,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:18:19,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-08 22:18:19,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-08 22:18:19,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:18:19,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-01-08 22:18:19,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:18:19,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-01-08 22:18:19,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:19,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:18:19,727 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 17 treesize of output 15 [2025-01-08 22:18:19,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-01-08 22:18:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:19,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451829081] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:18:19,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:18:19,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 15 [2025-01-08 22:18:19,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825199504] [2025-01-08 22:18:19,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:18:19,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-08 22:18:19,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:18:19,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-08 22:18:19,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-08 22:18:19,741 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:19,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:18:19,979 INFO L93 Difference]: Finished difference Result 107 states and 134 transitions. [2025-01-08 22:18:19,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-08 22:18:19,979 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-08 22:18:19,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:18:19,981 INFO L225 Difference]: With dead ends: 107 [2025-01-08 22:18:19,981 INFO L226 Difference]: Without dead ends: 98 [2025-01-08 22:18:19,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-01-08 22:18:19,982 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 111 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:18:19,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 105 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:18:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-08 22:18:19,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 38. [2025-01-08 22:18:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2025-01-08 22:18:19,987 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 17 [2025-01-08 22:18:19,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:18:19,987 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2025-01-08 22:18:19,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:19,987 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2025-01-08 22:18:19,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-08 22:18:19,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:18:19,988 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:18:19,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 22:18:20,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:18:20,192 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:18:20,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:18:20,193 INFO L85 PathProgramCache]: Analyzing trace with hash 546939067, now seen corresponding path program 1 times [2025-01-08 22:18:20,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:18:20,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841017534] [2025-01-08 22:18:20,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:18:20,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:18:20,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-08 22:18:20,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-08 22:18:20,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:18:20,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:20,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:20,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:18:20,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841017534] [2025-01-08 22:18:20,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841017534] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:18:20,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963898401] [2025-01-08 22:18:20,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:18:20,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:18:20,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:18:20,464 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:18:20,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:18:20,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-08 22:18:20,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-08 22:18:20,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:18:20,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:20,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-08 22:18:20,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:18:20,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-08 22:18:20,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-08 22:18:20,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:18:20,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-01-08 22:18:20,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:20,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:18:20,742 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 15 treesize of output 13 [2025-01-08 22:18:20,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-01-08 22:18:20,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:20,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963898401] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:18:20,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:18:20,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 7] total 18 [2025-01-08 22:18:20,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077622925] [2025-01-08 22:18:20,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:18:20,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-08 22:18:20,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:18:20,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-08 22:18:20,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-01-08 22:18:20,756 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:21,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:18:21,215 INFO L93 Difference]: Finished difference Result 114 states and 148 transitions. [2025-01-08 22:18:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-08 22:18:21,215 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-08 22:18:21,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:18:21,216 INFO L225 Difference]: With dead ends: 114 [2025-01-08 22:18:21,216 INFO L226 Difference]: Without dead ends: 112 [2025-01-08 22:18:21,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=348, Invalid=1292, Unknown=0, NotChecked=0, Total=1640 [2025-01-08 22:18:21,217 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 186 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:18:21,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 83 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:18:21,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-08 22:18:21,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 62. [2025-01-08 22:18:21,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 61 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:21,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2025-01-08 22:18:21,223 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 87 transitions. Word has length 17 [2025-01-08 22:18:21,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:18:21,223 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 87 transitions. [2025-01-08 22:18:21,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:21,224 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2025-01-08 22:18:21,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-08 22:18:21,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:18:21,224 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:18:21,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 22:18:21,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:18:21,425 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:18:21,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:18:21,426 INFO L85 PathProgramCache]: Analyzing trace with hash 519528784, now seen corresponding path program 1 times [2025-01-08 22:18:21,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:18:21,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22126026] [2025-01-08 22:18:21,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:18:21,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:18:21,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-08 22:18:21,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-08 22:18:21,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:18:21,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:21,456 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:21,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:18:21,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22126026] [2025-01-08 22:18:21,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22126026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:18:21,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:18:21,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:18:21,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308083111] [2025-01-08 22:18:21,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:18:21,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:18:21,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:18:21,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:18:21,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:18:21,457 INFO L87 Difference]: Start difference. First operand 62 states and 87 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:21,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:18:21,472 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2025-01-08 22:18:21,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:18:21,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-08 22:18:21,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:18:21,473 INFO L225 Difference]: With dead ends: 90 [2025-01-08 22:18:21,473 INFO L226 Difference]: Without dead ends: 71 [2025-01-08 22:18:21,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:18:21,474 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:18:21,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:18:21,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-08 22:18:21,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2025-01-08 22:18:21,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:21,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2025-01-08 22:18:21,479 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 22 [2025-01-08 22:18:21,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:18:21,479 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2025-01-08 22:18:21,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:21,479 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2025-01-08 22:18:21,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-08 22:18:21,480 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:18:21,480 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:18:21,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:18:21,480 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:18:21,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:18:21,480 INFO L85 PathProgramCache]: Analyzing trace with hash -722697453, now seen corresponding path program 1 times [2025-01-08 22:18:21,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:18:21,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361288630] [2025-01-08 22:18:21,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:18:21,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:18:21,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-08 22:18:21,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-08 22:18:21,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:18:21,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:21,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:21,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:18:21,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361288630] [2025-01-08 22:18:21,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361288630] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:18:21,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905756999] [2025-01-08 22:18:21,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:18:21,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:18:21,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:18:21,668 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:18:21,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 22:18:21,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-08 22:18:21,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-08 22:18:21,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:18:21,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:21,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-08 22:18:21,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:18:21,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-08 22:18:21,739 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 23 treesize of output 11 [2025-01-08 22:18:21,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:21,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:18:21,834 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 17 treesize of output 15 [2025-01-08 22:18:21,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-01-08 22:18:21,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:21,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905756999] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:18:21,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:18:21,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 14 [2025-01-08 22:18:21,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757865249] [2025-01-08 22:18:21,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:18:21,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-08 22:18:21,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:18:21,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-08 22:18:21,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:18:21,849 INFO L87 Difference]: Start difference. First operand 62 states and 83 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:22,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:18:22,098 INFO L93 Difference]: Finished difference Result 144 states and 183 transitions. [2025-01-08 22:18:22,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-08 22:18:22,098 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-08 22:18:22,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:18:22,099 INFO L225 Difference]: With dead ends: 144 [2025-01-08 22:18:22,100 INFO L226 Difference]: Without dead ends: 142 [2025-01-08 22:18:22,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2025-01-08 22:18:22,101 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 72 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:18:22,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 83 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:18:22,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-08 22:18:22,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 79. [2025-01-08 22:18:22,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:22,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 105 transitions. [2025-01-08 22:18:22,112 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 105 transitions. Word has length 22 [2025-01-08 22:18:22,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:18:22,112 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 105 transitions. [2025-01-08 22:18:22,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:22,113 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 105 transitions. [2025-01-08 22:18:22,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-08 22:18:22,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:18:22,113 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:18:22,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 22:18:22,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:18:22,314 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:18:22,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:18:22,315 INFO L85 PathProgramCache]: Analyzing trace with hash 875225811, now seen corresponding path program 1 times [2025-01-08 22:18:22,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:18:22,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388398930] [2025-01-08 22:18:22,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:18:22,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:18:22,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-08 22:18:22,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-08 22:18:22,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:18:22,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:22,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:18:22,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388398930] [2025-01-08 22:18:22,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388398930] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:18:22,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095845201] [2025-01-08 22:18:22,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:18:22,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:18:22,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:18:22,532 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:18:22,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 22:18:22,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-08 22:18:22,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-08 22:18:22,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:18:22,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:22,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-08 22:18:22,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:18:22,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-08 22:18:22,656 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 23 treesize of output 11 [2025-01-08 22:18:22,709 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 15 treesize of output 7 [2025-01-08 22:18:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:22,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:18:22,771 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 19 treesize of output 17 [2025-01-08 22:18:22,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2025-01-08 22:18:22,784 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:22,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095845201] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:18:22,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:18:22,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 19 [2025-01-08 22:18:22,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338445049] [2025-01-08 22:18:22,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:18:22,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-08 22:18:22,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:18:22,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-08 22:18:22,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-01-08 22:18:22,785 INFO L87 Difference]: Start difference. First operand 79 states and 105 transitions. Second operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:23,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:18:23,189 INFO L93 Difference]: Finished difference Result 218 states and 289 transitions. [2025-01-08 22:18:23,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-08 22:18:23,189 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-08 22:18:23,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:18:23,190 INFO L225 Difference]: With dead ends: 218 [2025-01-08 22:18:23,190 INFO L226 Difference]: Without dead ends: 175 [2025-01-08 22:18:23,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=291, Invalid=899, Unknown=0, NotChecked=0, Total=1190 [2025-01-08 22:18:23,192 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 148 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:18:23,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 117 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:18:23,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-01-08 22:18:23,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 107. [2025-01-08 22:18:23,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 106 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:23,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 142 transitions. [2025-01-08 22:18:23,202 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 142 transitions. Word has length 22 [2025-01-08 22:18:23,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:18:23,202 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 142 transitions. [2025-01-08 22:18:23,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:23,202 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 142 transitions. [2025-01-08 22:18:23,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-08 22:18:23,203 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:18:23,203 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:18:23,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-08 22:18:23,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-08 22:18:23,404 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:18:23,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:18:23,404 INFO L85 PathProgramCache]: Analyzing trace with hash -367307884, now seen corresponding path program 2 times [2025-01-08 22:18:23,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:18:23,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447511568] [2025-01-08 22:18:23,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:18:23,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:18:23,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-08 22:18:23,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-08 22:18:23,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:18:23,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:23,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:18:23,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447511568] [2025-01-08 22:18:23,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447511568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:18:23,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:18:23,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:18:23,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491524397] [2025-01-08 22:18:23,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:18:23,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:18:23,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:18:23,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:18:23,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:18:23,433 INFO L87 Difference]: Start difference. First operand 107 states and 142 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:23,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:18:23,453 INFO L93 Difference]: Finished difference Result 145 states and 184 transitions. [2025-01-08 22:18:23,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:18:23,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-08 22:18:23,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:18:23,454 INFO L225 Difference]: With dead ends: 145 [2025-01-08 22:18:23,454 INFO L226 Difference]: Without dead ends: 98 [2025-01-08 22:18:23,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:18:23,455 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:18:23,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 46 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:18:23,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-08 22:18:23,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 79. [2025-01-08 22:18:23,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.2820512820512822) internal successors, (100), 78 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:23,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2025-01-08 22:18:23,462 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 22 [2025-01-08 22:18:23,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:18:23,462 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2025-01-08 22:18:23,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:23,463 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2025-01-08 22:18:23,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-08 22:18:23,463 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:18:23,463 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:18:23,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:18:23,464 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:18:23,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:18:23,464 INFO L85 PathProgramCache]: Analyzing trace with hash -185062339, now seen corresponding path program 2 times [2025-01-08 22:18:23,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:18:23,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335998331] [2025-01-08 22:18:23,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:18:23,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:18:23,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-08 22:18:23,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-08 22:18:23,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:18:23,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:23,777 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:23,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:18:23,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335998331] [2025-01-08 22:18:23,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335998331] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:18:23,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685014004] [2025-01-08 22:18:23,778 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:18:23,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:18:23,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:18:23,780 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:18:23,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-08 22:18:23,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-08 22:18:23,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-08 22:18:23,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:18:23,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:23,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-08 22:18:23,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:18:23,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-08 22:18:24,019 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:24,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:18:24,121 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 17 treesize of output 15 [2025-01-08 22:18:24,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-01-08 22:18:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:24,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685014004] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:18:24,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:18:24,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 28 [2025-01-08 22:18:24,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262892685] [2025-01-08 22:18:24,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:18:24,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-08 22:18:24,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:18:24,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-08 22:18:24,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2025-01-08 22:18:24,141 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand has 28 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:25,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:18:25,374 INFO L93 Difference]: Finished difference Result 261 states and 319 transitions. [2025-01-08 22:18:25,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-08 22:18:25,374 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-01-08 22:18:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:18:25,375 INFO L225 Difference]: With dead ends: 261 [2025-01-08 22:18:25,375 INFO L226 Difference]: Without dead ends: 218 [2025-01-08 22:18:25,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=836, Invalid=3856, Unknown=0, NotChecked=0, Total=4692 [2025-01-08 22:18:25,377 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 260 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:18:25,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 128 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:18:25,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-01-08 22:18:25,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 140. [2025-01-08 22:18:25,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.2805755395683454) internal successors, (178), 139 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:25,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 178 transitions. [2025-01-08 22:18:25,386 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 178 transitions. Word has length 27 [2025-01-08 22:18:25,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:18:25,386 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 178 transitions. [2025-01-08 22:18:25,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:25,386 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 178 transitions. [2025-01-08 22:18:25,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-08 22:18:25,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:18:25,387 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:18:25,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-08 22:18:25,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-08 22:18:25,588 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:18:25,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:18:25,588 INFO L85 PathProgramCache]: Analyzing trace with hash -796941187, now seen corresponding path program 2 times [2025-01-08 22:18:25,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:18:25,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918407622] [2025-01-08 22:18:25,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:18:25,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:18:25,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-08 22:18:25,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-08 22:18:25,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:18:25,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:25,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:18:25,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918407622] [2025-01-08 22:18:25,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918407622] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:18:25,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099209873] [2025-01-08 22:18:25,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:18:25,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:18:25,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:18:25,861 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:18:25,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-08 22:18:25,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-08 22:18:25,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-08 22:18:25,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:18:25,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:25,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-08 22:18:25,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:18:25,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-08 22:18:26,131 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:26,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:18:26,204 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 19 treesize of output 17 [2025-01-08 22:18:26,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2025-01-08 22:18:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:26,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099209873] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:18:26,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:18:26,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 23 [2025-01-08 22:18:26,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052769258] [2025-01-08 22:18:26,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:18:26,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-08 22:18:26,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:18:26,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-08 22:18:26,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2025-01-08 22:18:26,222 INFO L87 Difference]: Start difference. First operand 140 states and 178 transitions. Second operand has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:27,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:18:27,163 INFO L93 Difference]: Finished difference Result 237 states and 288 transitions. [2025-01-08 22:18:27,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-08 22:18:27,163 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-01-08 22:18:27,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:18:27,164 INFO L225 Difference]: With dead ends: 237 [2025-01-08 22:18:27,164 INFO L226 Difference]: Without dead ends: 205 [2025-01-08 22:18:27,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=570, Invalid=2292, Unknown=0, NotChecked=0, Total=2862 [2025-01-08 22:18:27,165 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 235 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:18:27,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 130 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:18:27,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-01-08 22:18:27,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 151. [2025-01-08 22:18:27,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.2666666666666666) internal successors, (190), 150 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 190 transitions. [2025-01-08 22:18:27,180 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 190 transitions. Word has length 27 [2025-01-08 22:18:27,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:18:27,181 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 190 transitions. [2025-01-08 22:18:27,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 190 transitions. [2025-01-08 22:18:27,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-08 22:18:27,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:18:27,182 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:18:27,188 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-01-08 22:18:27,383 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,SelfDestructingSolverStorable11 [2025-01-08 22:18:27,383 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:18:27,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:18:27,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1309938716, now seen corresponding path program 1 times [2025-01-08 22:18:27,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:18:27,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073287620] [2025-01-08 22:18:27,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:18:27,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:18:27,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-08 22:18:27,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-08 22:18:27,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:18:27,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:27,420 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:18:27,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:18:27,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073287620] [2025-01-08 22:18:27,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073287620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:18:27,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:18:27,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:18:27,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219562640] [2025-01-08 22:18:27,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:18:27,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:18:27,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:18:27,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:18:27,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:18:27,421 INFO L87 Difference]: Start difference. First operand 151 states and 190 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:27,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:18:27,460 INFO L93 Difference]: Finished difference Result 181 states and 224 transitions. [2025-01-08 22:18:27,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:18:27,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-01-08 22:18:27,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:18:27,461 INFO L225 Difference]: With dead ends: 181 [2025-01-08 22:18:27,461 INFO L226 Difference]: Without dead ends: 134 [2025-01-08 22:18:27,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:18:27,462 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:18:27,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 46 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:18:27,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-08 22:18:27,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 120. [2025-01-08 22:18:27,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.226890756302521) internal successors, (146), 119 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2025-01-08 22:18:27,477 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 27 [2025-01-08 22:18:27,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:18:27,477 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2025-01-08 22:18:27,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:18:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2025-01-08 22:18:27,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-08 22:18:27,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:18:27,478 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:18:27,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 22:18:27,478 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:18:27,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:18:27,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1523191838, now seen corresponding path program 3 times [2025-01-08 22:18:27,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:18:27,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878541998] [2025-01-08 22:18:27,479 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:18:27,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:18:27,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-01-08 22:18:27,513 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-01-08 22:18:27,513 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-08 22:18:27,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:27,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:18:27,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878541998] [2025-01-08 22:18:27,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878541998] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:18:27,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076389683] [2025-01-08 22:18:27,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:18:27,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:18:27,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:18:27,932 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-01-08 22:18:27,934 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-01-08 22:18:27,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-01-08 22:18:27,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-01-08 22:18:27,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-08 22:18:27,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:27,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-08 22:18:27,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:18:28,030 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 19 treesize of output 1 [2025-01-08 22:18:28,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2025-01-08 22:18:28,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2025-01-08 22:18:28,120 INFO L349 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2025-01-08 22:18:28,120 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 47 treesize of output 28 [2025-01-08 22:18:28,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:18:28,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 10 [2025-01-08 22:18:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:18:28,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:18:41,928 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 35 treesize of output 33 [2025-01-08 22:18:41,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2025-01-08 22:18:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:18:42,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076389683] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:18:42,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:18:42,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 34 [2025-01-08 22:18:42,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319194258] [2025-01-08 22:18:42,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:18:42,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-08 22:18:42,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:18:42,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-08 22:18:42,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1011, Unknown=4, NotChecked=0, Total=1122 [2025-01-08 22:18:42,001 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 34 states, 34 states have (on average 2.764705882352941) internal successors, (94), 34 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:19:17,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:19:17,769 INFO L93 Difference]: Finished difference Result 298 states and 345 transitions. [2025-01-08 22:19:17,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-01-08 22:19:17,769 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.764705882352941) internal successors, (94), 34 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-08 22:19:17,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:19:17,770 INFO L225 Difference]: With dead ends: 298 [2025-01-08 22:19:17,770 INFO L226 Difference]: Without dead ends: 289 [2025-01-08 22:19:17,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1952 ImplicationChecksByTransitivity, 48.9s TimeCoverageRelationStatistics Valid=997, Invalid=6644, Unknown=15, NotChecked=0, Total=7656 [2025-01-08 22:19:17,772 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 362 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:19:17,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 478 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:19:17,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-01-08 22:19:17,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 195. [2025-01-08 22:19:17,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.1958762886597938) internal successors, (232), 194 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:19:17,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 232 transitions. [2025-01-08 22:19:17,795 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 232 transitions. Word has length 37 [2025-01-08 22:19:17,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:19:17,795 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 232 transitions. [2025-01-08 22:19:17,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.764705882352941) internal successors, (94), 34 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:19:17,796 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 232 transitions. [2025-01-08 22:19:17,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-08 22:19:17,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:19:17,796 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:19:17,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-08 22:19:17,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:19:17,997 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:19:17,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:19:17,998 INFO L85 PathProgramCache]: Analyzing trace with hash 454277211, now seen corresponding path program 1 times [2025-01-08 22:19:17,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:19:17,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658693964] [2025-01-08 22:19:17,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:19:17,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:19:18,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-08 22:19:18,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-08 22:19:18,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:19:18,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:19:18,021 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:19:18,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:19:18,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658693964] [2025-01-08 22:19:18,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658693964] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:19:18,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:19:18,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:19:18,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588834888] [2025-01-08 22:19:18,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:19:18,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:19:18,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:19:18,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:19:18,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:19:18,023 INFO L87 Difference]: Start difference. First operand 195 states and 232 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:19:18,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:19:18,045 INFO L93 Difference]: Finished difference Result 268 states and 317 transitions. [2025-01-08 22:19:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:19:18,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-08 22:19:18,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:19:18,046 INFO L225 Difference]: With dead ends: 268 [2025-01-08 22:19:18,046 INFO L226 Difference]: Without dead ends: 183 [2025-01-08 22:19:18,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:19:18,047 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:19:18,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 37 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:19:18,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-08 22:19:18,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 166. [2025-01-08 22:19:18,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.1575757575757575) internal successors, (191), 165 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:19:18,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 191 transitions. [2025-01-08 22:19:18,058 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 191 transitions. Word has length 37 [2025-01-08 22:19:18,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:19:18,059 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 191 transitions. [2025-01-08 22:19:18,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:19:18,059 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 191 transitions. [2025-01-08 22:19:18,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-08 22:19:18,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:19:18,059 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:19:18,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 22:19:18,059 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:19:18,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:19:18,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1928536224, now seen corresponding path program 1 times [2025-01-08 22:19:18,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:19:18,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001688914] [2025-01-08 22:19:18,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:19:18,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:19:18,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-08 22:19:18,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-08 22:19:18,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:19:18,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:19:18,288 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:19:18,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:19:18,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001688914] [2025-01-08 22:19:18,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001688914] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:19:18,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953246417] [2025-01-08 22:19:18,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:19:18,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:19:18,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:19:18,291 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:19:18,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-08 22:19:18,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-08 22:19:18,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-08 22:19:18,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:19:18,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:19:18,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-08 22:19:18,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:19:18,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-08 22:19:18,418 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 23 treesize of output 11 [2025-01-08 22:19:18,450 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 31 treesize of output 11 [2025-01-08 22:19:18,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:19:18,458 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 23 treesize of output 22 [2025-01-08 22:19:18,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:19:18,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:19:18,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 25 [2025-01-08 22:19:18,639 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:19:18,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:19:18,806 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 25 treesize of output 23 [2025-01-08 22:19:18,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-01-08 22:19:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:19:18,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953246417] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:19:18,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:19:18,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 30 [2025-01-08 22:19:18,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511037549] [2025-01-08 22:19:18,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:19:18,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-08 22:19:18,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:19:18,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-08 22:19:18,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2025-01-08 22:19:18,863 INFO L87 Difference]: Start difference. First operand 166 states and 191 transitions. Second operand has 30 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 30 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:19:34,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:19:34,120 INFO L93 Difference]: Finished difference Result 290 states and 328 transitions. [2025-01-08 22:19:34,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-01-08 22:19:34,121 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 30 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-08 22:19:34,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:19:34,122 INFO L225 Difference]: With dead ends: 290 [2025-01-08 22:19:34,122 INFO L226 Difference]: Without dead ends: 276 [2025-01-08 22:19:34,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1826 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=903, Invalid=5413, Unknown=4, NotChecked=0, Total=6320 [2025-01-08 22:19:34,123 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 215 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 82 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:19:34,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 209 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 847 Invalid, 1 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:19:34,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-01-08 22:19:34,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 189. [2025-01-08 22:19:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.1436170212765957) internal successors, (215), 188 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:19:34,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 215 transitions. [2025-01-08 22:19:34,138 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 215 transitions. Word has length 37 [2025-01-08 22:19:34,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:19:34,138 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 215 transitions. [2025-01-08 22:19:34,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 30 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:19:34,139 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 215 transitions. [2025-01-08 22:19:34,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-08 22:19:34,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:19:34,139 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:19:34,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-08 22:19:34,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-08 22:19:34,343 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:19:34,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:19:34,343 INFO L85 PathProgramCache]: Analyzing trace with hash 51093840, now seen corresponding path program 4 times [2025-01-08 22:19:34,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:19:34,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447224181] [2025-01-08 22:19:34,343 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:19:34,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:19:34,356 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-01-08 22:19:34,372 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-08 22:19:34,372 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:19:34,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:19:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:19:34,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:19:34,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447224181] [2025-01-08 22:19:34,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447224181] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:19:34,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939600327] [2025-01-08 22:19:34,595 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:19:34,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:19:34,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:19:34,599 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:19:34,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-08 22:19:34,643 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-01-08 22:19:34,662 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-08 22:19:34,662 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:19:34,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:19:34,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-08 22:19:34,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:19:34,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-08 22:19:34,739 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 23 treesize of output 11 [2025-01-08 22:19:34,908 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:19:34,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:19:34,976 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 17 treesize of output 15 [2025-01-08 22:19:34,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-01-08 22:19:34,993 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:19:34,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939600327] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:19:34,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:19:34,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 24 [2025-01-08 22:19:34,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463970380] [2025-01-08 22:19:34,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:19:34,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-08 22:19:34,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:19:34,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-08 22:19:34,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2025-01-08 22:19:34,994 INFO L87 Difference]: Start difference. First operand 189 states and 215 transitions. Second operand has 24 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:19:36,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:19:36,031 INFO L93 Difference]: Finished difference Result 323 states and 362 transitions. [2025-01-08 22:19:36,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-01-08 22:19:36,031 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-01-08 22:19:36,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:19:36,032 INFO L225 Difference]: With dead ends: 323 [2025-01-08 22:19:36,032 INFO L226 Difference]: Without dead ends: 321 [2025-01-08 22:19:36,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1542 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=659, Invalid=4311, Unknown=0, NotChecked=0, Total=4970 [2025-01-08 22:19:36,034 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 106 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:19:36,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 218 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:19:36,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-01-08 22:19:36,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 201. [2025-01-08 22:19:36,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.145) internal successors, (229), 200 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:19:36,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 229 transitions. [2025-01-08 22:19:36,054 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 229 transitions. Word has length 42 [2025-01-08 22:19:36,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:19:36,055 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 229 transitions. [2025-01-08 22:19:36,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:19:36,055 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 229 transitions. [2025-01-08 22:19:36,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-08 22:19:36,055 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:19:36,056 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:19:36,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-08 22:19:36,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:19:36,256 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:19:36,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:19:36,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1793116654, now seen corresponding path program 3 times [2025-01-08 22:19:36,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:19:36,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043645487] [2025-01-08 22:19:36,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:19:36,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:19:36,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 5 equivalence classes. [2025-01-08 22:19:36,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 42 of 42 statements. [2025-01-08 22:19:36,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-08 22:19:36,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:19:36,656 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:19:36,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:19:36,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043645487] [2025-01-08 22:19:36,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043645487] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:19:36,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594199344] [2025-01-08 22:19:36,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:19:36,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:19:36,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:19:36,663 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:19:36,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-08 22:19:36,709 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 5 equivalence classes. [2025-01-08 22:19:36,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 42 of 42 statements. [2025-01-08 22:19:36,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-08 22:19:36,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:19:36,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-08 22:19:36,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:19:36,884 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 13 treesize of output 9 [2025-01-08 22:19:36,923 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 29 treesize of output 13 [2025-01-08 22:19:37,264 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:19:37,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:19:37,423 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 19 treesize of output 17 [2025-01-08 22:19:37,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-01-08 22:19:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:19:37,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594199344] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:19:37,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:19:37,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 35 [2025-01-08 22:19:37,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592465871] [2025-01-08 22:19:37,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:19:37,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-08 22:19:37,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:19:37,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-08 22:19:37,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1054, Unknown=0, NotChecked=0, Total=1190 [2025-01-08 22:19:37,501 INFO L87 Difference]: Start difference. First operand 201 states and 229 transitions. Second operand has 35 states, 35 states have (on average 3.2857142857142856) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:19:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:19:39,457 INFO L93 Difference]: Finished difference Result 393 states and 440 transitions. [2025-01-08 22:19:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-01-08 22:19:39,457 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.2857142857142856) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-01-08 22:19:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:19:39,459 INFO L225 Difference]: With dead ends: 393 [2025-01-08 22:19:39,459 INFO L226 Difference]: Without dead ends: 384 [2025-01-08 22:19:39,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2252 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1237, Invalid=7135, Unknown=0, NotChecked=0, Total=8372 [2025-01-08 22:19:39,460 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 308 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:19:39,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 310 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:19:39,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-01-08 22:19:39,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 252. [2025-01-08 22:19:39,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.1394422310756973) internal successors, (286), 251 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:19:39,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 286 transitions. [2025-01-08 22:19:39,485 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 286 transitions. Word has length 42 [2025-01-08 22:19:39,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:19:39,486 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 286 transitions. [2025-01-08 22:19:39,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.2857142857142856) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:19:39,486 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 286 transitions. [2025-01-08 22:19:39,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-08 22:19:39,486 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:19:39,486 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:19:39,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-08 22:19:39,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-08 22:19:39,691 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:19:39,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:19:39,691 INFO L85 PathProgramCache]: Analyzing trace with hash -999345344, now seen corresponding path program 5 times [2025-01-08 22:19:39,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:19:39,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240357442] [2025-01-08 22:19:39,692 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:19:39,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:19:39,698 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 5 equivalence classes. [2025-01-08 22:19:39,707 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 47 of 47 statements. [2025-01-08 22:19:39,707 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-01-08 22:19:39,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:19:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 21 proven. 31 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:19:40,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:19:40,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240357442] [2025-01-08 22:19:40,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240357442] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:19:40,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107701044] [2025-01-08 22:19:40,161 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:19:40,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:19:40,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:19:40,163 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:19:40,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-08 22:19:40,212 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 5 equivalence classes. [2025-01-08 22:19:40,286 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 47 of 47 statements. [2025-01-08 22:19:40,286 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-01-08 22:19:40,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:19:40,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-08 22:19:40,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:19:40,319 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 13 treesize of output 9 [2025-01-08 22:19:40,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-08 22:19:40,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2025-01-08 22:19:40,374 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2025-01-08 22:19:40,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2025-01-08 22:19:40,401 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-08 22:19:40,401 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 1 case distinctions, treesize of input 47 treesize of output 28 [2025-01-08 22:19:40,449 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-08 22:19:40,449 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 1 case distinctions, treesize of input 47 treesize of output 28 [2025-01-08 22:19:40,473 INFO L349 Elim1Store]: treesize reduction 47, result has 31.9 percent of original size [2025-01-08 22:19:40,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 40 [2025-01-08 22:19:40,514 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-01-08 22:19:40,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 43 [2025-01-08 22:19:40,586 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-01-08 22:19:40,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 43 [2025-01-08 22:19:40,622 INFO L349 Elim1Store]: treesize reduction 84, result has 28.8 percent of original size [2025-01-08 22:19:40,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 55 [2025-01-08 22:19:40,696 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2025-01-08 22:19:40,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 58 [2025-01-08 22:19:56,964 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 23 proven. 29 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:19:56,964 INFO L312 TraceCheckSpWp]: Computing backward predicates...