./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_max.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/verifythis/tree_max.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 e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:12:48,180 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:12:48,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:12:48,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:12:48,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:12:48,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:12:48,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:12:48,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:12:48,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:12:48,240 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:12:48,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:12:48,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:12:48,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:12:48,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:12:48,241 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:12:48,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:12:48,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:12:48,241 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:12:48,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:12:48,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:12:48,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:12:48,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:12:48,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:12:48,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:12:48,242 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:12:48,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:12:48,242 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:12:48,242 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:12:48,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:12:48,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:12:48,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:12:48,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:12:48,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:12:48,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:12:48,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:12:48,243 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:12:48,243 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:12:48,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:12:48,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:12:48,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:12:48,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:12:48,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:12:48,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:12:48,243 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 -> e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c [2025-02-07 21:12:48,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:12:48,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:12:48,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:12:48,449 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:12:48,449 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:12:48,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_max.c [2025-02-07 21:12:49,494 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/883d9a859/a6999d4e7adf40aaa3e948bff0d13ed1/FLAG66ac2951e [2025-02-07 21:12:49,726 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:12:49,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c [2025-02-07 21:12:49,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/883d9a859/a6999d4e7adf40aaa3e948bff0d13ed1/FLAG66ac2951e [2025-02-07 21:12:49,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/883d9a859/a6999d4e7adf40aaa3e948bff0d13ed1 [2025-02-07 21:12:49,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:12:49,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:12:49,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:12:49,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:12:49,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:12:49,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:12:49" (1/1) ... [2025-02-07 21:12:49,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@942d2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:12:49, skipping insertion in model container [2025-02-07 21:12:49,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:12:49" (1/1) ... [2025-02-07 21:12:49,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:12:49,881 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/verifythis/tree_max.c[544,557] [2025-02-07 21:12:49,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:12:49,932 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:12:49,947 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/verifythis/tree_max.c[544,557] [2025-02-07 21:12:49,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:12:49,972 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:12:49,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:12:49 WrapperNode [2025-02-07 21:12:49,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:12:49,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:12:49,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:12:49,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:12:49,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:12:49" (1/1) ... [2025-02-07 21:12:49,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:12:49" (1/1) ... [2025-02-07 21:12:49,998 INFO L138 Inliner]: procedures = 24, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 39 [2025-02-07 21:12:49,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:12:49,999 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:12:49,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:12:50,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:12:50,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:12:49" (1/1) ... [2025-02-07 21:12:50,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:12:49" (1/1) ... [2025-02-07 21:12:50,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:12:49" (1/1) ... [2025-02-07 21:12:50,018 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-02-07 21:12:50,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:12:49" (1/1) ... [2025-02-07 21:12:50,021 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:12:49" (1/1) ... [2025-02-07 21:12:50,028 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:12:49" (1/1) ... [2025-02-07 21:12:50,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:12:49" (1/1) ... [2025-02-07 21:12:50,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:12:49" (1/1) ... [2025-02-07 21:12:50,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:12:49" (1/1) ... [2025-02-07 21:12:50,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:12:50,036 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:12:50,036 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:12:50,036 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:12:50,037 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:12:49" (1/1) ... [2025-02-07 21:12:50,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:12:50,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:12:50,068 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 21:12:50,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 21:12:50,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 21:12:50,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 21:12:50,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:12:50,089 INFO L130 BoogieDeclarations]: Found specification of procedure max [2025-02-07 21:12:50,090 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2025-02-07 21:12:50,090 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2025-02-07 21:12:50,090 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2025-02-07 21:12:50,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:12:50,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:12:50,091 INFO L130 BoogieDeclarations]: Found specification of procedure check [2025-02-07 21:12:50,091 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2025-02-07 21:12:50,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 21:12:50,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 21:12:50,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 21:12:50,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 21:12:50,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-07 21:12:50,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:12:50,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:12:50,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 21:12:50,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 21:12:50,158 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:12:50,160 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:12:50,233 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L38: havoc ~a~0, ~b~0, ~c~0; [2025-02-07 21:12:50,254 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L26: havoc ~n~0.base, ~n~0.offset; [2025-02-07 21:12:50,309 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-02-07 21:12:50,309 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:12:50,316 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:12:50,317 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:12:50,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:12:50 BoogieIcfgContainer [2025-02-07 21:12:50,318 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:12:50,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:12:50,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:12:50,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:12:50,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:12:49" (1/3) ... [2025-02-07 21:12:50,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57cda1c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:12:50, skipping insertion in model container [2025-02-07 21:12:50,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:12:49" (2/3) ... [2025-02-07 21:12:50,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57cda1c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:12:50, skipping insertion in model container [2025-02-07 21:12:50,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:12:50" (3/3) ... [2025-02-07 21:12:50,326 INFO L128 eAbstractionObserver]: Analyzing ICFG tree_max.c [2025-02-07 21:12:50,335 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:12:50,336 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree_max.c that has 4 procedures, 40 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-07 21:12:50,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:12:50,379 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;@35d0536e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:12:50,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:12:50,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 21:12:50,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 21:12:50,391 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:12:50,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:12:50,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:12:50,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:12:50,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1147523879, now seen corresponding path program 1 times [2025-02-07 21:12:50,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:12:50,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734609988] [2025-02-07 21:12:50,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:12:50,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:12:50,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 21:12:50,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 21:12:50,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:12:50,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:12:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:12:50,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:12:50,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734609988] [2025-02-07 21:12:50,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734609988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:12:50,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:12:50,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 21:12:50,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630569753] [2025-02-07 21:12:50,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:12:50,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 21:12:50,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:12:50,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 21:12:50,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 21:12:50,809 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 21:12:50,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:12:50,892 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2025-02-07 21:12:50,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 21:12:50,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-02-07 21:12:50,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:12:50,899 INFO L225 Difference]: With dead ends: 67 [2025-02-07 21:12:50,900 INFO L226 Difference]: Without dead ends: 35 [2025-02-07 21:12:50,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:12:50,906 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 273 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-02-07 21:12:50,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 273 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:12:50,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-07 21:12:50,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-07 21:12:50,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-07 21:12:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2025-02-07 21:12:50,927 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 18 [2025-02-07 21:12:50,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:12:50,928 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2025-02-07 21:12:50,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 21:12:50,928 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2025-02-07 21:12:50,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-07 21:12:50,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:12:50,929 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:12:50,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:12:50,929 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:12:50,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:12:50,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2126989805, now seen corresponding path program 1 times [2025-02-07 21:12:50,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:12:50,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376626619] [2025-02-07 21:12:50,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:12:50,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:12:50,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-07 21:12:50,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-07 21:12:50,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:12:50,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:12:51,134 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 21:12:51,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:12:51,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376626619] [2025-02-07 21:12:51,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376626619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:12:51,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:12:51,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 21:12:51,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101084382] [2025-02-07 21:12:51,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:12:51,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 21:12:51,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:12:51,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 21:12:51,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:12:51,137 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-07 21:12:51,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:12:51,183 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2025-02-07 21:12:51,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 21:12:51,183 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2025-02-07 21:12:51,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:12:51,184 INFO L225 Difference]: With dead ends: 48 [2025-02-07 21:12:51,184 INFO L226 Difference]: Without dead ends: 37 [2025-02-07 21:12:51,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:12:51,185 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:12:51,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 236 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:12:51,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-07 21:12:51,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-07 21:12:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 27 states have internal predecessors, (29), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-02-07 21:12:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2025-02-07 21:12:51,190 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 30 [2025-02-07 21:12:51,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:12:51,190 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2025-02-07 21:12:51,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-07 21:12:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2025-02-07 21:12:51,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-07 21:12:51,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:12:51,191 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:12:51,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:12:51,192 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:12:51,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:12:51,192 INFO L85 PathProgramCache]: Analyzing trace with hash -92976763, now seen corresponding path program 1 times [2025-02-07 21:12:51,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:12:51,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272113409] [2025-02-07 21:12:51,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:12:51,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:12:51,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-07 21:12:51,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 21:12:51,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:12:51,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:12:51,802 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 21:12:51,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:12:51,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272113409] [2025-02-07 21:12:51,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272113409] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:12:51,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333149285] [2025-02-07 21:12:51,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:12:51,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:12:51,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:12:51,807 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:12:51,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 21:12:51,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-07 21:12:51,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 21:12:51,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:12:51,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:12:51,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-07 21:12:51,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:12:51,979 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 8 treesize of output 1 [2025-02-07 21:12:52,195 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-02-07 21:12:52,217 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-07 21:12:52,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:12:52,474 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-07 21:12:52,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333149285] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:12:52,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:12:52,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 10] total 23 [2025-02-07 21:12:52,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373548063] [2025-02-07 21:12:52,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:12:52,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-07 21:12:52,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:12:52,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-07 21:12:52,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:12:52,477 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 23 states, 20 states have (on average 2.05) internal successors, (41), 18 states have internal predecessors, (41), 8 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-07 21:12:52,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:12:52,844 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2025-02-07 21:12:52,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-07 21:12:52,845 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.05) internal successors, (41), 18 states have internal predecessors, (41), 8 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) Word has length 43 [2025-02-07 21:12:52,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:12:52,845 INFO L225 Difference]: With dead ends: 46 [2025-02-07 21:12:52,846 INFO L226 Difference]: Without dead ends: 44 [2025-02-07 21:12:52,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2025-02-07 21:12:52,847 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 21:12:52,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 156 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 21:12:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-07 21:12:52,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2025-02-07 21:12:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 29 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-02-07 21:12:52,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2025-02-07 21:12:52,852 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 43 [2025-02-07 21:12:52,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:12:52,852 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2025-02-07 21:12:52,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.05) internal successors, (41), 18 states have internal predecessors, (41), 8 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-07 21:12:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2025-02-07 21:12:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-07 21:12:52,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:12:52,853 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:12:52,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 21:12:53,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:12:53,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:12:53,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:12:53,059 INFO L85 PathProgramCache]: Analyzing trace with hash -557683140, now seen corresponding path program 1 times [2025-02-07 21:12:53,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:12:53,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706033022] [2025-02-07 21:12:53,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:12:53,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:12:53,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-07 21:12:53,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-07 21:12:53,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:12:53,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:12:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-07 21:12:53,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:12:53,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706033022] [2025-02-07 21:12:53,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706033022] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:12:53,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123260] [2025-02-07 21:12:53,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:12:53,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:12:53,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:12:53,618 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:12:53,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 21:12:53,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-07 21:12:53,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-07 21:12:53,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:12:53,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:12:53,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-02-07 21:12:53,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:12:53,741 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-02-07 21:12:53,748 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-02-07 21:12:53,839 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-02-07 21:12:53,843 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-02-07 21:12:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-07 21:12:54,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:12:54,469 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-07 21:12:54,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123260] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:12:54,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:12:54,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 14] total 29 [2025-02-07 21:12:54,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353333758] [2025-02-07 21:12:54,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:12:54,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-07 21:12:54,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:12:54,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-07 21:12:54,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2025-02-07 21:12:54,472 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 29 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 22 states have internal predecessors, (61), 10 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16) [2025-02-07 21:12:55,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:12:55,620 INFO L93 Difference]: Finished difference Result 113 states and 154 transitions. [2025-02-07 21:12:55,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-07 21:12:55,621 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 22 states have internal predecessors, (61), 10 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16) Word has length 49 [2025-02-07 21:12:55,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:12:55,623 INFO L225 Difference]: With dead ends: 113 [2025-02-07 21:12:55,623 INFO L226 Difference]: Without dead ends: 99 [2025-02-07 21:12:55,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=281, Invalid=2581, Unknown=0, NotChecked=0, Total=2862 [2025-02-07 21:12:55,628 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 174 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 21:12:55,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 283 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 21:12:55,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-07 21:12:55,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2025-02-07 21:12:55,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 62 states have internal predecessors, (73), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (35), 16 states have call predecessors, (35), 13 states have call successors, (35) [2025-02-07 21:12:55,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2025-02-07 21:12:55,642 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 49 [2025-02-07 21:12:55,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:12:55,642 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2025-02-07 21:12:55,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 22 states have internal predecessors, (61), 10 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16) [2025-02-07 21:12:55,642 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2025-02-07 21:12:55,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-07 21:12:55,644 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:12:55,644 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:12:55,654 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-02-07 21:12:55,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:12:55,848 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:12:55,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:12:55,849 INFO L85 PathProgramCache]: Analyzing trace with hash -469948645, now seen corresponding path program 1 times [2025-02-07 21:12:55,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:12:55,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608394319] [2025-02-07 21:12:55,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:12:55,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:12:55,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-07 21:12:55,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-07 21:12:55,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:12:55,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:12:56,203 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-07 21:12:56,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:12:56,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608394319] [2025-02-07 21:12:56,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608394319] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:12:56,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064169164] [2025-02-07 21:12:56,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:12:56,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:12:56,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:12:56,206 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:12:56,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 21:12:56,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-07 21:12:56,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-07 21:12:56,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:12:56,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:12:56,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-07 21:12:56,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:12:56,305 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-02-07 21:12:56,311 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-02-07 21:12:56,559 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-07 21:12:56,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:12:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-07 21:12:56,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064169164] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:12:56,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:12:56,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 20 [2025-02-07 21:12:56,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328478085] [2025-02-07 21:12:56,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:12:56,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-07 21:12:56,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:12:56,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-07 21:12:56,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-02-07 21:12:56,682 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 9 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-07 21:12:56,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:12:56,948 INFO L93 Difference]: Finished difference Result 149 states and 206 transitions. [2025-02-07 21:12:56,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-07 21:12:56,949 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 9 states have call predecessors, (13), 5 states have call successors, (13) Word has length 49 [2025-02-07 21:12:56,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:12:56,956 INFO L225 Difference]: With dead ends: 149 [2025-02-07 21:12:56,956 INFO L226 Difference]: Without dead ends: 106 [2025-02-07 21:12:56,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2025-02-07 21:12:56,957 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 27 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:12:56,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 499 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:12:56,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-07 21:12:56,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2025-02-07 21:12:56,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 67 states have internal predecessors, (79), 17 states have call successors, (17), 8 states have call predecessors, (17), 11 states have return successors, (35), 18 states have call predecessors, (35), 12 states have call successors, (35) [2025-02-07 21:12:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2025-02-07 21:12:56,975 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 49 [2025-02-07 21:12:56,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:12:56,975 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 131 transitions. [2025-02-07 21:12:56,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 9 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-07 21:12:56,975 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2025-02-07 21:12:56,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-07 21:12:56,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:12:56,977 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:12:56,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 21:12:57,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:12:57,181 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:12:57,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:12:57,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1907306193, now seen corresponding path program 2 times [2025-02-07 21:12:57,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:12:57,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843837424] [2025-02-07 21:12:57,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:12:57,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:12:57,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-02-07 21:12:57,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-02-07 21:12:57,212 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 21:12:57,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:12:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-07 21:12:57,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:12:57,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843837424] [2025-02-07 21:12:57,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843837424] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:12:57,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678819470] [2025-02-07 21:12:57,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:12:57,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:12:57,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:12:57,670 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:12:57,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 21:12:57,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-02-07 21:12:57,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-02-07 21:12:57,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 21:12:57,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:12:57,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-07 21:12:57,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:12:57,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 21:12:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-07 21:12:58,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:12:58,357 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-07 21:12:58,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678819470] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:12:58,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:12:58,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13] total 30 [2025-02-07 21:12:58,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053544423] [2025-02-07 21:12:58,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:12:58,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-07 21:12:58,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:12:58,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-07 21:12:58,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2025-02-07 21:12:58,359 INFO L87 Difference]: Start difference. First operand 94 states and 131 transitions. Second operand has 30 states, 25 states have (on average 2.48) internal successors, (62), 26 states have internal predecessors, (62), 13 states have call successors, (20), 3 states have call predecessors, (20), 11 states have return successors, (19), 15 states have call predecessors, (19), 12 states have call successors, (19) [2025-02-07 21:13:02,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 21:13:06,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 21:13:10,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 21:13:14,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 21:13:18,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 21:13:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:13:18,866 INFO L93 Difference]: Finished difference Result 152 states and 214 transitions. [2025-02-07 21:13:18,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-07 21:13:18,866 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.48) internal successors, (62), 26 states have internal predecessors, (62), 13 states have call successors, (20), 3 states have call predecessors, (20), 11 states have return successors, (19), 15 states have call predecessors, (19), 12 states have call successors, (19) Word has length 61 [2025-02-07 21:13:18,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:13:18,868 INFO L225 Difference]: With dead ends: 152 [2025-02-07 21:13:18,868 INFO L226 Difference]: Without dead ends: 131 [2025-02-07 21:13:18,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=1250, Unknown=0, NotChecked=0, Total=1406 [2025-02-07 21:13:18,869 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 43 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 17 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2025-02-07 21:13:18,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 838 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 604 Invalid, 5 Unknown, 0 Unchecked, 20.4s Time] [2025-02-07 21:13:18,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-07 21:13:18,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 105. [2025-02-07 21:13:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 75 states have internal predecessors, (90), 18 states have call successors, (18), 9 states have call predecessors, (18), 13 states have return successors, (42), 20 states have call predecessors, (42), 13 states have call successors, (42) [2025-02-07 21:13:18,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2025-02-07 21:13:18,881 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 61 [2025-02-07 21:13:18,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:13:18,881 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2025-02-07 21:13:18,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.48) internal successors, (62), 26 states have internal predecessors, (62), 13 states have call successors, (20), 3 states have call predecessors, (20), 11 states have return successors, (19), 15 states have call predecessors, (19), 12 states have call successors, (19) [2025-02-07 21:13:18,882 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2025-02-07 21:13:18,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-07 21:13:18,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:13:18,883 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:13:18,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 21:13:19,087 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,SelfDestructingSolverStorable5 [2025-02-07 21:13:19,088 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:13:19,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:13:19,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1883060817, now seen corresponding path program 3 times [2025-02-07 21:13:19,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:13:19,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360802811] [2025-02-07 21:13:19,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 21:13:19,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:13:19,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 74 statements into 5 equivalence classes. [2025-02-07 21:13:19,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 74 of 74 statements. [2025-02-07 21:13:19,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-07 21:13:19,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:13:20,835 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 25 proven. 41 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-07 21:13:20,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:13:20,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360802811] [2025-02-07 21:13:20,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360802811] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:13:20,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109740656] [2025-02-07 21:13:20,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 21:13:20,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:13:20,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:13:20,837 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:13:20,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 21:13:20,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 74 statements into 5 equivalence classes. [2025-02-07 21:13:20,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 74 of 74 statements. [2025-02-07 21:13:20,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-07 21:13:20,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:13:20,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 111 conjuncts are in the unsatisfiable core [2025-02-07 21:13:20,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:13:21,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 21:13:21,022 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-02-07 21:13:22,510 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 32 treesize of output 20 [2025-02-07 21:13:22,519 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-02-07 21:13:22,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 10 [2025-02-07 21:13:22,677 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 9 [2025-02-07 21:13:22,717 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-07 21:13:22,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:13:23,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 21:13:23,325 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 34 [2025-02-07 21:13:23,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109740656] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:13:23,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 21:13:23,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 60 [2025-02-07 21:13:23,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395841933] [2025-02-07 21:13:23,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 21:13:23,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-02-07 21:13:23,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:13:23,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-02-07 21:13:23,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=4456, Unknown=0, NotChecked=0, Total=4692 [2025-02-07 21:13:23,810 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand has 60 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 46 states have internal predecessors, (74), 16 states have call successors, (19), 7 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 12 states have call successors, (18) [2025-02-07 21:13:28,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:13:28,184 INFO L93 Difference]: Finished difference Result 424 states and 746 transitions. [2025-02-07 21:13:28,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2025-02-07 21:13:28,185 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 46 states have internal predecessors, (74), 16 states have call successors, (19), 7 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 12 states have call successors, (18) Word has length 74 [2025-02-07 21:13:28,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:13:28,188 INFO L225 Difference]: With dead ends: 424 [2025-02-07 21:13:28,188 INFO L226 Difference]: Without dead ends: 384 [2025-02-07 21:13:28,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5572 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1174, Invalid=18566, Unknown=0, NotChecked=0, Total=19740 [2025-02-07 21:13:28,192 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 156 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 2777 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 2882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-07 21:13:28,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 650 Invalid, 2882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2777 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-07 21:13:28,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-02-07 21:13:28,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 159. [2025-02-07 21:13:28,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 112 states have (on average 1.25) internal successors, (140), 114 states have internal predecessors, (140), 27 states have call successors, (27), 15 states have call predecessors, (27), 19 states have return successors, (60), 29 states have call predecessors, (60), 19 states have call successors, (60) [2025-02-07 21:13:28,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 227 transitions. [2025-02-07 21:13:28,241 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 227 transitions. Word has length 74 [2025-02-07 21:13:28,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:13:28,243 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 227 transitions. [2025-02-07 21:13:28,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 46 states have internal predecessors, (74), 16 states have call successors, (19), 7 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 12 states have call successors, (18) [2025-02-07 21:13:28,243 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 227 transitions. [2025-02-07 21:13:28,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 21:13:28,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:13:28,246 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:13:28,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-07 21:13:28,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:13:28,447 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:13:28,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:13:28,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1134961249, now seen corresponding path program 1 times [2025-02-07 21:13:28,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:13:28,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233536919] [2025-02-07 21:13:28,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:13:28,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:13:28,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 21:13:28,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:13:28,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:13:28,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:13:29,443 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 24 proven. 26 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-07 21:13:29,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:13:29,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233536919] [2025-02-07 21:13:29,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233536919] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:13:29,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343949907] [2025-02-07 21:13:29,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:13:29,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:13:29,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:13:29,450 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:13:29,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 21:13:29,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 21:13:29,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:13:29,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:13:29,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:13:29,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-02-07 21:13:29,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:13:29,581 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-02-07 21:13:29,583 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-02-07 21:13:30,669 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 13 [2025-02-07 21:13:30,794 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 9 [2025-02-07 21:13:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 24 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-07 21:13:30,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:13:31,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 21:13:31,675 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 35 treesize of output 38 [2025-02-07 21:13:31,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343949907] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:13:31,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 21:13:31,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 56 [2025-02-07 21:13:31,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230795410] [2025-02-07 21:13:31,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 21:13:31,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-02-07 21:13:31,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:13:31,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-02-07 21:13:31,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=4598, Unknown=0, NotChecked=0, Total=4830 [2025-02-07 21:13:31,973 INFO L87 Difference]: Start difference. First operand 159 states and 227 transitions. Second operand has 56 states, 46 states have (on average 1.608695652173913) internal successors, (74), 40 states have internal predecessors, (74), 16 states have call successors, (19), 6 states have call predecessors, (19), 13 states have return successors, (17), 16 states have call predecessors, (17), 12 states have call successors, (17) [2025-02-07 21:13:34,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:13:34,030 INFO L93 Difference]: Finished difference Result 398 states and 621 transitions. [2025-02-07 21:13:34,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-02-07 21:13:34,031 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 46 states have (on average 1.608695652173913) internal successors, (74), 40 states have internal predecessors, (74), 16 states have call successors, (19), 6 states have call predecessors, (19), 13 states have return successors, (17), 16 states have call predecessors, (17), 12 states have call successors, (17) Word has length 75 [2025-02-07 21:13:34,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:13:34,034 INFO L225 Difference]: With dead ends: 398 [2025-02-07 21:13:34,034 INFO L226 Difference]: Without dead ends: 292 [2025-02-07 21:13:34,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2187 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=478, Invalid=8452, Unknown=0, NotChecked=0, Total=8930 [2025-02-07 21:13:34,036 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 51 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 1988 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 2020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:13:34,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1058 Invalid, 2020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1988 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-07 21:13:34,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-02-07 21:13:34,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 190. [2025-02-07 21:13:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 139 states have (on average 1.2589928057553956) internal successors, (175), 133 states have internal predecessors, (175), 29 states have call successors, (29), 15 states have call predecessors, (29), 21 states have return successors, (78), 41 states have call predecessors, (78), 21 states have call successors, (78) [2025-02-07 21:13:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 282 transitions. [2025-02-07 21:13:34,068 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 282 transitions. Word has length 75 [2025-02-07 21:13:34,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:13:34,068 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 282 transitions. [2025-02-07 21:13:34,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 46 states have (on average 1.608695652173913) internal successors, (74), 40 states have internal predecessors, (74), 16 states have call successors, (19), 6 states have call predecessors, (19), 13 states have return successors, (17), 16 states have call predecessors, (17), 12 states have call successors, (17) [2025-02-07 21:13:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 282 transitions. [2025-02-07 21:13:34,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 21:13:34,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:13:34,070 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:13:34,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-07 21:13:34,270 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,SelfDestructingSolverStorable7 [2025-02-07 21:13:34,270 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:13:34,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:13:34,271 INFO L85 PathProgramCache]: Analyzing trace with hash -2008977187, now seen corresponding path program 1 times [2025-02-07 21:13:34,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:13:34,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700401151] [2025-02-07 21:13:34,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:13:34,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:13:34,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 21:13:34,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:13:34,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:13:34,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:13:34,379 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-02-07 21:13:34,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:13:34,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700401151] [2025-02-07 21:13:34,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700401151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:13:34,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:13:34,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 21:13:34,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823599979] [2025-02-07 21:13:34,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:13:34,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 21:13:34,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:13:34,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 21:13:34,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 21:13:34,381 INFO L87 Difference]: Start difference. First operand 190 states and 282 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-07 21:13:34,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:13:34,468 INFO L93 Difference]: Finished difference Result 340 states and 527 transitions. [2025-02-07 21:13:34,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 21:13:34,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 75 [2025-02-07 21:13:34,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:13:34,470 INFO L225 Difference]: With dead ends: 340 [2025-02-07 21:13:34,472 INFO L226 Difference]: Without dead ends: 203 [2025-02-07 21:13:34,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-07 21:13:34,473 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:13:34,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 214 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:13:34,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-07 21:13:34,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 190. [2025-02-07 21:13:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 139 states have (on average 1.2589928057553956) internal successors, (175), 133 states have internal predecessors, (175), 29 states have call successors, (29), 15 states have call predecessors, (29), 21 states have return successors, (78), 41 states have call predecessors, (78), 21 states have call successors, (78) [2025-02-07 21:13:34,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 282 transitions. [2025-02-07 21:13:34,491 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 282 transitions. Word has length 75 [2025-02-07 21:13:34,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:13:34,492 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 282 transitions. [2025-02-07 21:13:34,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-07 21:13:34,492 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 282 transitions. [2025-02-07 21:13:34,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 21:13:34,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:13:34,497 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:13:34,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 21:13:34,497 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:13:34,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:13:34,497 INFO L85 PathProgramCache]: Analyzing trace with hash 597046367, now seen corresponding path program 2 times [2025-02-07 21:13:34,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:13:34,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569485231] [2025-02-07 21:13:34,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:13:34,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:13:34,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-02-07 21:13:34,513 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:13:34,513 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 21:13:34,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:13:34,697 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-07 21:13:34,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:13:34,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569485231] [2025-02-07 21:13:34,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569485231] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:13:34,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415603389] [2025-02-07 21:13:34,698 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:13:34,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:13:34,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:13:34,700 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:13:34,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-07 21:13:34,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-02-07 21:13:34,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:13:34,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 21:13:34,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:13:34,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-07 21:13:34,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:13:34,931 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-07 21:13:34,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:13:35,241 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-07 21:13:35,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415603389] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:13:35,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:13:35,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 20 [2025-02-07 21:13:35,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521063112] [2025-02-07 21:13:35,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:13:35,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-07 21:13:35,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:13:35,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-07 21:13:35,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2025-02-07 21:13:35,245 INFO L87 Difference]: Start difference. First operand 190 states and 282 transitions. Second operand has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (12), 9 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-07 21:13:35,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:13:35,537 INFO L93 Difference]: Finished difference Result 386 states and 609 transitions. [2025-02-07 21:13:35,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-07 21:13:35,541 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (12), 9 states have call predecessors, (12), 3 states have call successors, (12) Word has length 75 [2025-02-07 21:13:35,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:13:35,544 INFO L225 Difference]: With dead ends: 386 [2025-02-07 21:13:35,544 INFO L226 Difference]: Without dead ends: 249 [2025-02-07 21:13:35,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 131 SyntacticMatches, 11 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2025-02-07 21:13:35,545 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:13:35,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 495 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:13:35,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-02-07 21:13:35,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 208. [2025-02-07 21:13:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 153 states have (on average 1.2352941176470589) internal successors, (189), 144 states have internal predecessors, (189), 31 states have call successors, (31), 15 states have call predecessors, (31), 23 states have return successors, (99), 48 states have call predecessors, (99), 23 states have call successors, (99) [2025-02-07 21:13:35,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 319 transitions. [2025-02-07 21:13:35,579 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 319 transitions. Word has length 75 [2025-02-07 21:13:35,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:13:35,579 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 319 transitions. [2025-02-07 21:13:35,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (12), 9 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-07 21:13:35,580 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 319 transitions. [2025-02-07 21:13:35,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 21:13:35,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:13:35,583 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:13:35,590 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-02-07 21:13:35,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:13:35,784 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:13:35,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:13:35,785 INFO L85 PathProgramCache]: Analyzing trace with hash -281186195, now seen corresponding path program 1 times [2025-02-07 21:13:35,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:13:35,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970844802] [2025-02-07 21:13:35,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:13:35,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:13:35,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 21:13:35,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 21:13:35,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:13:35,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:13:36,634 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 30 proven. 14 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-07 21:13:36,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:13:36,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970844802] [2025-02-07 21:13:36,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970844802] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:13:36,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156918050] [2025-02-07 21:13:36,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:13:36,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:13:36,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:13:36,636 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-02-07 21:13:36,638 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-02-07 21:13:36,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 21:13:36,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 21:13:36,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:13:36,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:13:36,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-02-07 21:13:36,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:13:36,821 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-02-07 21:13:36,824 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-02-07 21:13:37,514 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 23 treesize of output 11 [2025-02-07 21:13:37,530 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-02-07 21:13:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-07 21:13:37,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:13:38,084 INFO L349 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2025-02-07 21:13:38,084 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 25 treesize of output 25 [2025-02-07 21:13:38,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156918050] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:13:38,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 21:13:38,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 41 [2025-02-07 21:13:38,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003723167] [2025-02-07 21:13:38,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 21:13:38,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-07 21:13:38,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:13:38,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-07 21:13:38,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2690, Unknown=0, NotChecked=0, Total=2862 [2025-02-07 21:13:38,293 INFO L87 Difference]: Start difference. First operand 208 states and 319 transitions. Second operand has 41 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 30 states have internal predecessors, (66), 14 states have call successors, (18), 5 states have call predecessors, (18), 9 states have return successors, (17), 15 states have call predecessors, (17), 11 states have call successors, (17) [2025-02-07 21:13:39,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:13:39,329 INFO L93 Difference]: Finished difference Result 293 states and 448 transitions. [2025-02-07 21:13:39,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-07 21:13:39,330 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 30 states have internal predecessors, (66), 14 states have call successors, (18), 5 states have call predecessors, (18), 9 states have return successors, (17), 15 states have call predecessors, (17), 11 states have call successors, (17) Word has length 76 [2025-02-07 21:13:39,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:13:39,332 INFO L225 Difference]: With dead ends: 293 [2025-02-07 21:13:39,332 INFO L226 Difference]: Without dead ends: 291 [2025-02-07 21:13:39,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=283, Invalid=4139, Unknown=0, NotChecked=0, Total=4422 [2025-02-07 21:13:39,334 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 37 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 21:13:39,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 508 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 21:13:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-02-07 21:13:39,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 192. [2025-02-07 21:13:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 140 states have (on average 1.2214285714285715) internal successors, (171), 134 states have internal predecessors, (171), 30 states have call successors, (30), 15 states have call predecessors, (30), 21 states have return successors, (79), 42 states have call predecessors, (79), 22 states have call successors, (79) [2025-02-07 21:13:39,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 280 transitions. [2025-02-07 21:13:39,354 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 280 transitions. Word has length 76 [2025-02-07 21:13:39,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:13:39,354 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 280 transitions. [2025-02-07 21:13:39,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 30 states have internal predecessors, (66), 14 states have call successors, (18), 5 states have call predecessors, (18), 9 states have return successors, (17), 15 states have call predecessors, (17), 11 states have call successors, (17) [2025-02-07 21:13:39,354 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 280 transitions. [2025-02-07 21:13:39,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 21:13:39,356 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:13:39,356 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:13:39,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-07 21:13:39,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:13:39,560 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:13:39,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:13:39,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1561049873, now seen corresponding path program 1 times [2025-02-07 21:13:39,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:13:39,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446457938] [2025-02-07 21:13:39,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:13:39,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:13:39,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 21:13:39,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 21:13:39,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:13:39,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:13:40,727 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 23 proven. 45 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-07 21:13:40,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:13:40,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446457938] [2025-02-07 21:13:40,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446457938] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:13:40,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507867567] [2025-02-07 21:13:40,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:13:40,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:13:40,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:13:40,730 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-02-07 21:13:40,731 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-02-07 21:13:40,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 21:13:40,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 21:13:40,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:13:40,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:13:40,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-02-07 21:13:40,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:13:40,917 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-02-07 21:13:40,918 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-02-07 21:13:42,082 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 13 [2025-02-07 21:13:42,222 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 9 [2025-02-07 21:13:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 20 proven. 31 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-07 21:13:42,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:13:43,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 21:13:43,136 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 33 treesize of output 36 [2025-02-07 21:13:43,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507867567] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:13:43,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 21:13:43,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32] total 60 [2025-02-07 21:13:43,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242671522] [2025-02-07 21:13:43,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 21:13:43,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-02-07 21:13:43,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:13:43,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-02-07 21:13:43,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=5447, Unknown=0, NotChecked=0, Total=5700 [2025-02-07 21:13:43,761 INFO L87 Difference]: Start difference. First operand 192 states and 280 transitions. Second operand has 60 states, 50 states have (on average 1.66) internal successors, (83), 44 states have internal predecessors, (83), 18 states have call successors, (23), 8 states have call predecessors, (23), 13 states have return successors, (20), 19 states have call predecessors, (20), 14 states have call successors, (20) [2025-02-07 21:13:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:13:47,819 INFO L93 Difference]: Finished difference Result 311 states and 459 transitions. [2025-02-07 21:13:47,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-02-07 21:13:47,819 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 50 states have (on average 1.66) internal successors, (83), 44 states have internal predecessors, (83), 18 states have call successors, (23), 8 states have call predecessors, (23), 13 states have return successors, (20), 19 states have call predecessors, (20), 14 states have call successors, (20) Word has length 76 [2025-02-07 21:13:47,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:13:47,825 INFO L225 Difference]: With dead ends: 311 [2025-02-07 21:13:47,825 INFO L226 Difference]: Without dead ends: 309 [2025-02-07 21:13:47,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3245 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=831, Invalid=13689, Unknown=0, NotChecked=0, Total=14520 [2025-02-07 21:13:47,826 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 132 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 3761 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 3856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 3761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:13:47,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 411 Invalid, 3856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 3761 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-07 21:13:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-02-07 21:13:47,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 179. [2025-02-07 21:13:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 131 states have (on average 1.2366412213740459) internal successors, (162), 124 states have internal predecessors, (162), 28 states have call successors, (28), 14 states have call predecessors, (28), 19 states have return successors, (77), 40 states have call predecessors, (77), 22 states have call successors, (77) [2025-02-07 21:13:47,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 267 transitions. [2025-02-07 21:13:47,852 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 267 transitions. Word has length 76 [2025-02-07 21:13:47,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:13:47,852 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 267 transitions. [2025-02-07 21:13:47,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 50 states have (on average 1.66) internal successors, (83), 44 states have internal predecessors, (83), 18 states have call successors, (23), 8 states have call predecessors, (23), 13 states have return successors, (20), 19 states have call predecessors, (20), 14 states have call successors, (20) [2025-02-07 21:13:47,852 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 267 transitions. [2025-02-07 21:13:47,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-07 21:13:47,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:13:47,854 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:13:47,864 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-02-07 21:13:48,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:13:48,054 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:13:48,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:13:48,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1194810650, now seen corresponding path program 1 times [2025-02-07 21:13:48,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:13:48,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497993576] [2025-02-07 21:13:48,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:13:48,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:13:48,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-07 21:13:48,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-07 21:13:48,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:13:48,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:13:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 24 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-07 21:13:48,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:13:48,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497993576] [2025-02-07 21:13:48,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497993576] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:13:48,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441914116] [2025-02-07 21:13:48,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:13:48,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:13:48,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:13:48,912 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-02-07 21:13:48,913 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-02-07 21:13:48,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-07 21:13:49,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-07 21:13:49,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:13:49,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:13:49,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-02-07 21:13:49,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:13:49,048 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-02-07 21:13:49,049 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-02-07 21:13:49,576 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 21 proven. 26 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-07 21:13:49,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:14:03,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441914116] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:14:03,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 21:14:03,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18] total 36 [2025-02-07 21:14:03,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897032168] [2025-02-07 21:14:03,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 21:14:03,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-07 21:14:03,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:03,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-07 21:14:03,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1518, Unknown=3, NotChecked=0, Total=1640 [2025-02-07 21:14:03,798 INFO L87 Difference]: Start difference. First operand 179 states and 267 transitions. Second operand has 36 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 16 states have call successors, (20), 7 states have call predecessors, (20), 9 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) [2025-02-07 21:14:05,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:05,142 INFO L93 Difference]: Finished difference Result 338 states and 576 transitions. [2025-02-07 21:14:05,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-07 21:14:05,143 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 16 states have call successors, (20), 7 states have call predecessors, (20), 9 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) Word has length 80 [2025-02-07 21:14:05,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:05,146 INFO L225 Difference]: With dead ends: 338 [2025-02-07 21:14:05,146 INFO L226 Difference]: Without dead ends: 326 [2025-02-07 21:14:05,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=260, Invalid=3159, Unknown=3, NotChecked=0, Total=3422 [2025-02-07 21:14:05,148 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 58 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:05,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 954 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 21:14:05,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-02-07 21:14:05,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 241. [2025-02-07 21:14:05,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 181 states have (on average 1.2320441988950277) internal successors, (223), 170 states have internal predecessors, (223), 34 states have call successors, (34), 19 states have call predecessors, (34), 25 states have return successors, (109), 51 states have call predecessors, (109), 25 states have call successors, (109) [2025-02-07 21:14:05,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 366 transitions. [2025-02-07 21:14:05,184 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 366 transitions. Word has length 80 [2025-02-07 21:14:05,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:05,184 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 366 transitions. [2025-02-07 21:14:05,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 16 states have call successors, (20), 7 states have call predecessors, (20), 9 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) [2025-02-07 21:14:05,184 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 366 transitions. [2025-02-07 21:14:05,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-07 21:14:05,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:05,187 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:14:05,198 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-02-07 21:14:05,391 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,SelfDestructingSolverStorable12 [2025-02-07 21:14:05,391 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:05,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:05,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1107076155, now seen corresponding path program 4 times [2025-02-07 21:14:05,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:05,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787157117] [2025-02-07 21:14:05,392 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 21:14:05,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:05,401 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 80 statements into 2 equivalence classes. [2025-02-07 21:14:05,415 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-02-07 21:14:05,415 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 21:14:05,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:06,314 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 11 proven. 44 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-07 21:14:06,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:06,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787157117] [2025-02-07 21:14:06,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787157117] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:14:06,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319522146] [2025-02-07 21:14:06,315 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 21:14:06,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:14:06,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:14:06,318 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-02-07 21:14:06,319 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-02-07 21:14:06,414 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 80 statements into 2 equivalence classes. [2025-02-07 21:14:06,462 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-02-07 21:14:06,462 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 21:14:06,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:06,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-02-07 21:14:06,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:14:06,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-07 21:14:06,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 21:14:06,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 21:14:06,542 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-07 21:14:06,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-07 21:14:06,576 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 27 treesize of output 15 [2025-02-07 21:14:06,582 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-02-07 21:14:07,431 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-07 21:14:07,431 INFO L312 TraceCheckSpWp]: Computing backward predicates...