./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i -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 35d5d98b2de2e0b78fe3c9610b248d897f0c998920a2ad434c7b6ace2f6d7db4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:04:10,121 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:04:10,200 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:04:10,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:04:10,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:04:10,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:04:10,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:04:10,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:04:10,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:04:10,241 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:04:10,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:04:10,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:04:10,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:04:10,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:04:10,242 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:04:10,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:04:10,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:04:10,243 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:04:10,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:04:10,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:04:10,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:04:10,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:04:10,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:04:10,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:04:10,244 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:04:10,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:04:10,244 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:04:10,244 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:04:10,244 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:04:10,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:04:10,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:04:10,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:04:10,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:04:10,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:04:10,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:04:10,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:04:10,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:04:10,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:04:10,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:04:10,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:04:10,246 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:04:10,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:04:10,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:04:10,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:04:10,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:04:10,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:04:10,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:04:10,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:04:10,246 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 -> 35d5d98b2de2e0b78fe3c9610b248d897f0c998920a2ad434c7b6ace2f6d7db4 [2025-01-09 16:04:10,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:04:10,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:04:10,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:04:10,537 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:04:10,537 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:04:10,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i [2025-01-09 16:04:11,777 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9661d2149/2a8e6d87d0854f89bd3cb9381179c1f2/FLAG96297b1ce [2025-01-09 16:04:12,044 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:04:12,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i [2025-01-09 16:04:12,055 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9661d2149/2a8e6d87d0854f89bd3cb9381179c1f2/FLAG96297b1ce [2025-01-09 16:04:12,072 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9661d2149/2a8e6d87d0854f89bd3cb9381179c1f2 [2025-01-09 16:04:12,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:04:12,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:04:12,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:04:12,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:04:12,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:04:12,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:04:12" (1/1) ... [2025-01-09 16:04:12,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3748fba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:12, skipping insertion in model container [2025-01-09 16:04:12,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:04:12" (1/1) ... [2025-01-09 16:04:12,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:04:12,243 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i[916,929] [2025-01-09 16:04:12,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:04:12,316 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:04:12,326 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i[916,929] [2025-01-09 16:04:12,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:04:12,389 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:04:12,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:12 WrapperNode [2025-01-09 16:04:12,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:04:12,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:04:12,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:04:12,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:04:12,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:12" (1/1) ... [2025-01-09 16:04:12,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:12" (1/1) ... [2025-01-09 16:04:12,444 INFO L138 Inliner]: procedures = 27, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 405 [2025-01-09 16:04:12,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:04:12,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:04:12,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:04:12,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:04:12,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:12" (1/1) ... [2025-01-09 16:04:12,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:12" (1/1) ... [2025-01-09 16:04:12,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:12" (1/1) ... [2025-01-09 16:04:12,492 INFO L175 MemorySlicer]: Split 120 memory accesses to 2 slices as follows [2, 118]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2025-01-09 16:04:12,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:12" (1/1) ... [2025-01-09 16:04:12,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:12" (1/1) ... [2025-01-09 16:04:12,506 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:12" (1/1) ... [2025-01-09 16:04:12,507 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:12" (1/1) ... [2025-01-09 16:04:12,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:12" (1/1) ... [2025-01-09 16:04:12,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:12" (1/1) ... [2025-01-09 16:04:12,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:12" (1/1) ... [2025-01-09 16:04:12,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:04:12,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:04:12,522 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:04:12,522 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:04:12,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:12" (1/1) ... [2025-01-09 16:04:12,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:04:12,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:12,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:04:12,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:04:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:04:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 16:04:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 16:04:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:04:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:04:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:04:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:04:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:04:12,585 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:04:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:04:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:04:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:04:12,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:04:12,701 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:04:12,702 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:04:13,090 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-01-09 16:04:13,091 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:04:13,106 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:04:13,107 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:04:13,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:04:13 BoogieIcfgContainer [2025-01-09 16:04:13,107 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:04:13,109 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:04:13,109 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:04:13,113 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:04:13,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:04:12" (1/3) ... [2025-01-09 16:04:13,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af626d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:04:13, skipping insertion in model container [2025-01-09 16:04:13,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:04:12" (2/3) ... [2025-01-09 16:04:13,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af626d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:04:13, skipping insertion in model container [2025-01-09 16:04:13,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:04:13" (3/3) ... [2025-01-09 16:04:13,119 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-87.i [2025-01-09 16:04:13,133 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:04:13,134 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-87.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:04:13,195 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:04:13,206 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;@6093f0a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:04:13,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:04:13,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 70 states have internal predecessors, (94), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:04:13,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 16:04:13,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:13,224 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:13,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:13,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:13,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1057740186, now seen corresponding path program 1 times [2025-01-09 16:04:13,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:13,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109155414] [2025-01-09 16:04:13,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:13,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:13,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 16:04:13,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 16:04:13,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:13,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:13,858 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 16:04:13,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:13,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109155414] [2025-01-09 16:04:13,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109155414] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:04:13,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60335455] [2025-01-09 16:04:13,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:13,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:13,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:13,864 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:04:13,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:04:13,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 16:04:14,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 16:04:14,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:14,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:14,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:04:14,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:14,113 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:04:14,113 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:14,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60335455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:14,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:04:14,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 16:04:14,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364572804] [2025-01-09 16:04:14,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:14,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:04:14,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:14,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:04:14,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:04:14,142 INFO L87 Difference]: Start difference. First operand has 86 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 70 states have internal predecessors, (94), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:14,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:14,199 INFO L93 Difference]: Finished difference Result 169 states and 257 transitions. [2025-01-09 16:04:14,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:04:14,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-01-09 16:04:14,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:14,209 INFO L225 Difference]: With dead ends: 169 [2025-01-09 16:04:14,210 INFO L226 Difference]: Without dead ends: 86 [2025-01-09 16:04:14,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:04:14,216 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:14,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:04:14,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-09 16:04:14,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2025-01-09 16:04:14,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:04:14,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2025-01-09 16:04:14,259 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 111 [2025-01-09 16:04:14,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:14,260 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2025-01-09 16:04:14,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:14,261 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2025-01-09 16:04:14,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 16:04:14,264 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:14,265 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:14,271 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-01-09 16:04:14,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 16:04:14,466 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:14,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:14,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1737798556, now seen corresponding path program 1 times [2025-01-09 16:04:14,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:14,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921001097] [2025-01-09 16:04:14,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:14,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:14,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 16:04:14,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 16:04:14,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:14,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 16:04:14,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:14,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921001097] [2025-01-09 16:04:14,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921001097] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:04:14,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376753417] [2025-01-09 16:04:14,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:14,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:14,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:14,713 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:04:14,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:04:14,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 16:04:14,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 16:04:14,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:14,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:14,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:04:14,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:04:14,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:14,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376753417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:14,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:04:14,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 16:04:14,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171650702] [2025-01-09 16:04:14,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:14,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:04:14,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:14,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:04:14,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:04:14,884 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:14,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:14,934 INFO L93 Difference]: Finished difference Result 170 states and 235 transitions. [2025-01-09 16:04:14,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:04:14,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-01-09 16:04:14,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:14,938 INFO L225 Difference]: With dead ends: 170 [2025-01-09 16:04:14,938 INFO L226 Difference]: Without dead ends: 88 [2025-01-09 16:04:14,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:04:14,939 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:14,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 328 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:04:14,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-09 16:04:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2025-01-09 16:04:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 71 states have internal predecessors, (91), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:04:14,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2025-01-09 16:04:14,956 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 111 [2025-01-09 16:04:14,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:14,957 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2025-01-09 16:04:14,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2025-01-09 16:04:14,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 16:04:14,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:14,961 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:14,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:04:15,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:15,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:15,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:15,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1739645598, now seen corresponding path program 1 times [2025-01-09 16:04:15,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:15,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544459727] [2025-01-09 16:04:15,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:15,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:15,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 16:04:15,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 16:04:15,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:15,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 16:04:15,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:15,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544459727] [2025-01-09 16:04:15,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544459727] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:04:15,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038813888] [2025-01-09 16:04:15,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:15,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:15,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:15,420 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:04:15,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:04:15,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 16:04:15,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 16:04:15,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:15,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:15,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:04:15,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:04:15,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:15,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038813888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:15,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:04:15,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-01-09 16:04:15,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938683082] [2025-01-09 16:04:15,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:15,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:04:15,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:15,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:04:15,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:04:15,607 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:15,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:15,643 INFO L93 Difference]: Finished difference Result 173 states and 238 transitions. [2025-01-09 16:04:15,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:04:15,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-01-09 16:04:15,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:15,646 INFO L225 Difference]: With dead ends: 173 [2025-01-09 16:04:15,646 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 16:04:15,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:04:15,647 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:15,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:04:15,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 16:04:15,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-09 16:04:15,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:04:15,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2025-01-09 16:04:15,661 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 111 [2025-01-09 16:04:15,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:15,662 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2025-01-09 16:04:15,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:15,662 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2025-01-09 16:04:15,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 16:04:15,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:15,666 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:15,674 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-01-09 16:04:15,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:15,867 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:15,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:15,868 INFO L85 PathProgramCache]: Analyzing trace with hash -343849961, now seen corresponding path program 1 times [2025-01-09 16:04:15,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:15,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542159100] [2025-01-09 16:04:15,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:15,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:15,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 16:04:15,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 16:04:15,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:15,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:16,667 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:04:16,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:16,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542159100] [2025-01-09 16:04:16,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542159100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:16,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:16,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:04:16,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528981909] [2025-01-09 16:04:16,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:16,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:04:16,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:16,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:04:16,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:04:16,671 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 16:04:17,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:17,125 INFO L93 Difference]: Finished difference Result 254 states and 348 transitions. [2025-01-09 16:04:17,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:04:17,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2025-01-09 16:04:17,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:17,127 INFO L225 Difference]: With dead ends: 254 [2025-01-09 16:04:17,129 INFO L226 Difference]: Without dead ends: 168 [2025-01-09 16:04:17,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:04:17,132 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 87 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:17,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 374 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:04:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-09 16:04:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 101. [2025-01-09 16:04:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 85 states have internal predecessors, (111), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:04:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 139 transitions. [2025-01-09 16:04:17,153 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 139 transitions. Word has length 113 [2025-01-09 16:04:17,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:17,153 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 139 transitions. [2025-01-09 16:04:17,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 16:04:17,154 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 139 transitions. [2025-01-09 16:04:17,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 16:04:17,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:17,155 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:17,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:04:17,155 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:17,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:17,156 INFO L85 PathProgramCache]: Analyzing trace with hash 956233506, now seen corresponding path program 1 times [2025-01-09 16:04:17,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:17,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085325167] [2025-01-09 16:04:17,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:17,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:17,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 16:04:17,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 16:04:17,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:17,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:04:17,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:17,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085325167] [2025-01-09 16:04:17,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085325167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:17,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:17,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:04:17,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925888721] [2025-01-09 16:04:17,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:17,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:04:17,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:17,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:04:17,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:04:17,569 INFO L87 Difference]: Start difference. First operand 101 states and 139 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:17,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:17,824 INFO L93 Difference]: Finished difference Result 270 states and 370 transitions. [2025-01-09 16:04:17,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:04:17,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2025-01-09 16:04:17,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:17,827 INFO L225 Difference]: With dead ends: 270 [2025-01-09 16:04:17,827 INFO L226 Difference]: Without dead ends: 172 [2025-01-09 16:04:17,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:04:17,829 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 68 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:17,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 517 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:04:17,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-09 16:04:17,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 169. [2025-01-09 16:04:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 144 states have (on average 1.2986111111111112) internal successors, (187), 145 states have internal predecessors, (187), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 16:04:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 231 transitions. [2025-01-09 16:04:17,852 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 231 transitions. Word has length 113 [2025-01-09 16:04:17,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:17,852 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 231 transitions. [2025-01-09 16:04:17,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:17,852 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 231 transitions. [2025-01-09 16:04:17,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 16:04:17,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:17,853 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:17,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:04:17,854 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:17,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:17,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1248019396, now seen corresponding path program 1 times [2025-01-09 16:04:17,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:17,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003988348] [2025-01-09 16:04:17,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:17,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:17,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 16:04:17,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 16:04:17,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:17,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:04:19,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:19,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003988348] [2025-01-09 16:04:19,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003988348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:19,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:19,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:04:19,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501093166] [2025-01-09 16:04:19,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:19,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:04:19,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:19,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:04:19,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:04:19,074 INFO L87 Difference]: Start difference. First operand 169 states and 231 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 16:04:19,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:19,523 INFO L93 Difference]: Finished difference Result 347 states and 471 transitions. [2025-01-09 16:04:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:04:19,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-01-09 16:04:19,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:19,528 INFO L225 Difference]: With dead ends: 347 [2025-01-09 16:04:19,529 INFO L226 Difference]: Without dead ends: 181 [2025-01-09 16:04:19,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:04:19,532 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 56 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:19,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 553 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:04:19,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-09 16:04:19,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2025-01-09 16:04:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 150 states have (on average 1.28) internal successors, (192), 152 states have internal predecessors, (192), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 16:04:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 240 transitions. [2025-01-09 16:04:19,560 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 240 transitions. Word has length 114 [2025-01-09 16:04:19,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:19,561 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 240 transitions. [2025-01-09 16:04:19,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 16:04:19,561 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 240 transitions. [2025-01-09 16:04:19,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 16:04:19,562 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:19,562 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:19,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:04:19,563 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:19,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:19,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1406496375, now seen corresponding path program 1 times [2025-01-09 16:04:19,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:19,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692812068] [2025-01-09 16:04:19,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:19,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:19,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 16:04:19,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 16:04:19,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:19,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:20,378 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:04:20,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:20,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692812068] [2025-01-09 16:04:20,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692812068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:20,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:20,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:04:20,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348822638] [2025-01-09 16:04:20,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:20,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:04:20,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:20,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:04:20,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:04:20,381 INFO L87 Difference]: Start difference. First operand 178 states and 240 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 16:04:20,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:20,657 INFO L93 Difference]: Finished difference Result 352 states and 468 transitions. [2025-01-09 16:04:20,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:04:20,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2025-01-09 16:04:20,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:20,662 INFO L225 Difference]: With dead ends: 352 [2025-01-09 16:04:20,662 INFO L226 Difference]: Without dead ends: 182 [2025-01-09 16:04:20,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:04:20,664 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 43 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:20,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 332 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:04:20,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-09 16:04:20,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 170. [2025-01-09 16:04:20,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 143 states have (on average 1.2657342657342658) internal successors, (181), 144 states have internal predecessors, (181), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 16:04:20,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 225 transitions. [2025-01-09 16:04:20,688 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 225 transitions. Word has length 115 [2025-01-09 16:04:20,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:20,688 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 225 transitions. [2025-01-09 16:04:20,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 16:04:20,688 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 225 transitions. [2025-01-09 16:04:20,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 16:04:20,690 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:20,690 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:20,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:04:20,690 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:20,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:20,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1756283538, now seen corresponding path program 1 times [2025-01-09 16:04:20,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:20,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680817455] [2025-01-09 16:04:20,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:20,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:20,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 16:04:20,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 16:04:20,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:20,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:21,107 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:04:21,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:21,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680817455] [2025-01-09 16:04:21,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680817455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:21,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:21,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:04:21,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560692454] [2025-01-09 16:04:21,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:21,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:04:21,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:21,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:04:21,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:04:21,110 INFO L87 Difference]: Start difference. First operand 170 states and 225 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:21,307 INFO L93 Difference]: Finished difference Result 345 states and 456 transitions. [2025-01-09 16:04:21,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:04:21,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-01-09 16:04:21,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:21,310 INFO L225 Difference]: With dead ends: 345 [2025-01-09 16:04:21,310 INFO L226 Difference]: Without dead ends: 178 [2025-01-09 16:04:21,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:04:21,311 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 71 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:21,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 197 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:04:21,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-01-09 16:04:21,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 131. [2025-01-09 16:04:21,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 113 states have (on average 1.2743362831858407) internal successors, (144), 113 states have internal predecessors, (144), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:04:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 172 transitions. [2025-01-09 16:04:21,331 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 172 transitions. Word has length 115 [2025-01-09 16:04:21,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:21,332 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 172 transitions. [2025-01-09 16:04:21,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:21,332 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 172 transitions. [2025-01-09 16:04:21,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 16:04:21,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:21,333 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:21,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:04:21,333 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:21,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:21,334 INFO L85 PathProgramCache]: Analyzing trace with hash -20570866, now seen corresponding path program 1 times [2025-01-09 16:04:21,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:21,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556529877] [2025-01-09 16:04:21,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:21,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:21,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 16:04:21,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 16:04:21,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:21,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:04:22,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:22,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556529877] [2025-01-09 16:04:22,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556529877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:22,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:22,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:04:22,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207479946] [2025-01-09 16:04:22,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:22,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:04:22,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:22,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:04:22,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:04:22,092 INFO L87 Difference]: Start difference. First operand 131 states and 172 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 16:04:22,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:22,422 INFO L93 Difference]: Finished difference Result 170 states and 218 transitions. [2025-01-09 16:04:22,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:04:22,424 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2025-01-09 16:04:22,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:22,426 INFO L225 Difference]: With dead ends: 170 [2025-01-09 16:04:22,426 INFO L226 Difference]: Without dead ends: 168 [2025-01-09 16:04:22,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:04:22,428 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 71 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:22,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 455 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:04:22,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-09 16:04:22,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2025-01-09 16:04:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 136 states have (on average 1.2279411764705883) internal successors, (167), 137 states have internal predecessors, (167), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 16:04:22,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 215 transitions. [2025-01-09 16:04:22,448 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 215 transitions. Word has length 115 [2025-01-09 16:04:22,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:22,448 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 215 transitions. [2025-01-09 16:04:22,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 16:04:22,450 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 215 transitions. [2025-01-09 16:04:22,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 16:04:22,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:22,452 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:22,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:04:22,453 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:22,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:22,454 INFO L85 PathProgramCache]: Analyzing trace with hash -18723824, now seen corresponding path program 1 times [2025-01-09 16:04:22,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:22,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988713733] [2025-01-09 16:04:22,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:22,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:22,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 16:04:22,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 16:04:22,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:22,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:04:23,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:23,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988713733] [2025-01-09 16:04:23,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988713733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:23,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:23,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:04:23,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267684640] [2025-01-09 16:04:23,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:23,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:04:23,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:23,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:04:23,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:04:23,096 INFO L87 Difference]: Start difference. First operand 167 states and 215 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 16:04:23,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:23,547 INFO L93 Difference]: Finished difference Result 387 states and 492 transitions. [2025-01-09 16:04:23,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:04:23,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2025-01-09 16:04:23,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:23,551 INFO L225 Difference]: With dead ends: 387 [2025-01-09 16:04:23,551 INFO L226 Difference]: Without dead ends: 252 [2025-01-09 16:04:23,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:04:23,552 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 116 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:23,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 413 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:04:23,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-01-09 16:04:23,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 249. [2025-01-09 16:04:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 202 states have (on average 1.198019801980198) internal successors, (242), 204 states have internal predecessors, (242), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:04:23,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 314 transitions. [2025-01-09 16:04:23,586 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 314 transitions. Word has length 115 [2025-01-09 16:04:23,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:23,586 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 314 transitions. [2025-01-09 16:04:23,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 16:04:23,586 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 314 transitions. [2025-01-09 16:04:23,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 16:04:23,588 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:23,588 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:23,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:04:23,588 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:23,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:23,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1858625388, now seen corresponding path program 1 times [2025-01-09 16:04:23,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:23,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358898532] [2025-01-09 16:04:23,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:23,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:23,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 16:04:23,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 16:04:23,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:23,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:23,804 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:04:23,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:23,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358898532] [2025-01-09 16:04:23,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358898532] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:23,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:23,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:04:23,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673073115] [2025-01-09 16:04:23,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:23,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:04:23,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:23,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:04:23,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:04:23,805 INFO L87 Difference]: Start difference. First operand 249 states and 314 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:24,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:24,037 INFO L93 Difference]: Finished difference Result 616 states and 770 transitions. [2025-01-09 16:04:24,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:04:24,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-01-09 16:04:24,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:24,041 INFO L225 Difference]: With dead ends: 616 [2025-01-09 16:04:24,041 INFO L226 Difference]: Without dead ends: 399 [2025-01-09 16:04:24,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:04:24,042 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 58 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:24,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 470 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:04:24,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-01-09 16:04:24,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 395. [2025-01-09 16:04:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 332 states have (on average 1.1897590361445782) internal successors, (395), 336 states have internal predecessors, (395), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 16:04:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 491 transitions. [2025-01-09 16:04:24,078 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 491 transitions. Word has length 115 [2025-01-09 16:04:24,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:24,078 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 491 transitions. [2025-01-09 16:04:24,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:24,078 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 491 transitions. [2025-01-09 16:04:24,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 16:04:24,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:24,080 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:24,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:04:24,080 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:24,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:24,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1463911984, now seen corresponding path program 1 times [2025-01-09 16:04:24,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:24,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714424527] [2025-01-09 16:04:24,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:24,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:24,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 16:04:24,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 16:04:24,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:24,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:04:25,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:25,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714424527] [2025-01-09 16:04:25,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714424527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:25,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:25,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:04:25,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492729659] [2025-01-09 16:04:25,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:25,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:04:25,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:25,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:04:25,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:04:25,250 INFO L87 Difference]: Start difference. First operand 395 states and 491 transitions. Second operand has 10 states, 8 states have (on average 6.0) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 16:04:25,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:25,862 INFO L93 Difference]: Finished difference Result 760 states and 943 transitions. [2025-01-09 16:04:25,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:04:25,863 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.0) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2025-01-09 16:04:25,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:25,867 INFO L225 Difference]: With dead ends: 760 [2025-01-09 16:04:25,868 INFO L226 Difference]: Without dead ends: 397 [2025-01-09 16:04:25,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:04:25,870 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 52 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:25,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 801 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:04:25,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-01-09 16:04:25,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 387. [2025-01-09 16:04:25,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 324 states have (on average 1.1820987654320987) internal successors, (383), 328 states have internal predecessors, (383), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 16:04:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 479 transitions. [2025-01-09 16:04:25,921 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 479 transitions. Word has length 115 [2025-01-09 16:04:25,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:25,922 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 479 transitions. [2025-01-09 16:04:25,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.0) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 16:04:25,922 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 479 transitions. [2025-01-09 16:04:25,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 16:04:25,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:25,925 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:25,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:04:25,925 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:25,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:25,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1655104871, now seen corresponding path program 1 times [2025-01-09 16:04:25,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:25,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435598698] [2025-01-09 16:04:25,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:25,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:25,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 16:04:25,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 16:04:25,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:25,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:26,154 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:04:26,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:26,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435598698] [2025-01-09 16:04:26,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435598698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:26,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:26,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:04:26,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373002264] [2025-01-09 16:04:26,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:26,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:04:26,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:26,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:04:26,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:04:26,156 INFO L87 Difference]: Start difference. First operand 387 states and 479 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:26,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:26,567 INFO L93 Difference]: Finished difference Result 1071 states and 1329 transitions. [2025-01-09 16:04:26,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:04:26,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-01-09 16:04:26,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:26,573 INFO L225 Difference]: With dead ends: 1071 [2025-01-09 16:04:26,574 INFO L226 Difference]: Without dead ends: 716 [2025-01-09 16:04:26,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:04:26,577 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 93 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:26,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 796 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:04:26,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-01-09 16:04:26,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 695. [2025-01-09 16:04:26,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 582 states have (on average 1.1769759450171822) internal successors, (685), 590 states have internal predecessors, (685), 86 states have call successors, (86), 26 states have call predecessors, (86), 26 states have return successors, (86), 78 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 16:04:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 857 transitions. [2025-01-09 16:04:26,645 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 857 transitions. Word has length 116 [2025-01-09 16:04:26,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:26,647 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 857 transitions. [2025-01-09 16:04:26,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:26,647 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 857 transitions. [2025-01-09 16:04:26,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 16:04:26,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:26,648 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:26,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:04:26,649 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:26,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:26,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1248458365, now seen corresponding path program 1 times [2025-01-09 16:04:26,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:26,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788484426] [2025-01-09 16:04:26,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:26,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:26,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 16:04:26,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 16:04:26,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:26,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:26,879 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 16:04:26,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:26,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788484426] [2025-01-09 16:04:26,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788484426] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:04:26,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138213111] [2025-01-09 16:04:26,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:26,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:26,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:26,882 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:04:26,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:04:26,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 16:04:27,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 16:04:27,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:27,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:27,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 16:04:27,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:27,144 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-01-09 16:04:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-01-09 16:04:27,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:04:27,332 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 16:04:27,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138213111] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:04:27,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:04:27,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-01-09 16:04:27,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077937042] [2025-01-09 16:04:27,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:04:27,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:04:27,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:27,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:04:27,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:04:27,334 INFO L87 Difference]: Start difference. First operand 695 states and 857 transitions. Second operand has 10 states, 8 states have (on average 7.375) internal successors, (59), 10 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 16:04:27,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:27,886 INFO L93 Difference]: Finished difference Result 1063 states and 1309 transitions. [2025-01-09 16:04:27,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:04:27,887 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.375) internal successors, (59), 10 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) Word has length 116 [2025-01-09 16:04:27,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:27,890 INFO L225 Difference]: With dead ends: 1063 [2025-01-09 16:04:27,890 INFO L226 Difference]: Without dead ends: 400 [2025-01-09 16:04:27,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 226 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:04:27,892 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 137 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:27,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 245 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:04:27,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-01-09 16:04:27,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 389. [2025-01-09 16:04:27,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 320 states have (on average 1.175) internal successors, (376), 324 states have internal predecessors, (376), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 16:04:27,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 480 transitions. [2025-01-09 16:04:27,931 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 480 transitions. Word has length 116 [2025-01-09 16:04:27,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:27,931 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 480 transitions. [2025-01-09 16:04:27,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.375) internal successors, (59), 10 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 16:04:27,931 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 480 transitions. [2025-01-09 16:04:27,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 16:04:27,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:27,933 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:27,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 16:04:28,136 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,SelfDestructingSolverStorable13 [2025-01-09 16:04:28,137 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:28,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:28,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1638463369, now seen corresponding path program 1 times [2025-01-09 16:04:28,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:28,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019751847] [2025-01-09 16:04:28,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:28,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:28,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 16:04:28,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 16:04:28,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:28,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:28,559 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:04:28,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:28,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019751847] [2025-01-09 16:04:28,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019751847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:28,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:28,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:04:28,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380571045] [2025-01-09 16:04:28,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:28,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:04:28,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:28,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:04:28,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:04:28,561 INFO L87 Difference]: Start difference. First operand 389 states and 480 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 16:04:28,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:28,831 INFO L93 Difference]: Finished difference Result 742 states and 914 transitions. [2025-01-09 16:04:28,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:04:28,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2025-01-09 16:04:28,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:28,834 INFO L225 Difference]: With dead ends: 742 [2025-01-09 16:04:28,834 INFO L226 Difference]: Without dead ends: 389 [2025-01-09 16:04:28,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:04:28,835 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 91 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:28,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 132 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:04:28,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-01-09 16:04:28,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2025-01-09 16:04:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 320 states have (on average 1.15625) internal successors, (370), 324 states have internal predecessors, (370), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 16:04:28,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 474 transitions. [2025-01-09 16:04:28,881 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 474 transitions. Word has length 117 [2025-01-09 16:04:28,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:28,882 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 474 transitions. [2025-01-09 16:04:28,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 16:04:28,882 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 474 transitions. [2025-01-09 16:04:28,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 16:04:28,883 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:28,883 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:28,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:04:28,883 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:28,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:28,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1141701186, now seen corresponding path program 1 times [2025-01-09 16:04:28,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:28,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295781353] [2025-01-09 16:04:28,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:28,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:28,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 16:04:28,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 16:04:28,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:28,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:04:29,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:29,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295781353] [2025-01-09 16:04:29,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295781353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:29,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:29,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:04:29,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445651777] [2025-01-09 16:04:29,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:29,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:04:29,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:29,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:04:29,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:04:29,546 INFO L87 Difference]: Start difference. First operand 389 states and 474 transitions. Second operand has 7 states, 5 states have (on average 10.4) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 16:04:29,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:29,952 INFO L93 Difference]: Finished difference Result 751 states and 909 transitions. [2025-01-09 16:04:29,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:04:29,953 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 10.4) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2025-01-09 16:04:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:29,955 INFO L225 Difference]: With dead ends: 751 [2025-01-09 16:04:29,955 INFO L226 Difference]: Without dead ends: 398 [2025-01-09 16:04:29,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:04:29,959 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 70 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:29,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 414 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:04:29,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-01-09 16:04:30,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 391. [2025-01-09 16:04:30,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 322 states have (on average 1.1428571428571428) internal successors, (368), 326 states have internal predecessors, (368), 51 states have call successors, (51), 17 states have call predecessors, (51), 17 states have return successors, (51), 47 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 16:04:30,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 470 transitions. [2025-01-09 16:04:30,007 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 470 transitions. Word has length 119 [2025-01-09 16:04:30,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:30,007 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 470 transitions. [2025-01-09 16:04:30,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 10.4) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 16:04:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 470 transitions. [2025-01-09 16:04:30,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 16:04:30,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:30,009 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:30,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:04:30,010 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:30,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:30,010 INFO L85 PathProgramCache]: Analyzing trace with hash -302410979, now seen corresponding path program 1 times [2025-01-09 16:04:30,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:30,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414623846] [2025-01-09 16:04:30,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:30,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:30,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 16:04:30,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 16:04:30,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:30,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:04:30,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [263538299] [2025-01-09 16:04:30,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:30,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:30,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:30,082 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:04:30,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:04:30,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 16:04:30,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 16:04:30,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:30,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:30,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 16:04:30,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:30,375 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 46 treesize of output 45 [2025-01-09 16:04:30,413 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 61 treesize of output 53 [2025-01-09 16:04:30,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:04:30,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:04:30,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:04:30,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:04:30,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:04:30,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:04:30,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 1 [2025-01-09 16:04:30,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:04:30,786 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 15 treesize of output 15 [2025-01-09 16:04:30,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:30,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 54 treesize of output 59 [2025-01-09 16:04:31,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:31,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 68 treesize of output 28 [2025-01-09 16:04:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:04:31,107 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:31,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:31,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414623846] [2025-01-09 16:04:31,108 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:04:31,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263538299] [2025-01-09 16:04:31,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263538299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:31,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:31,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:04:31,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348627405] [2025-01-09 16:04:31,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:31,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:04:31,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:31,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:04:31,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:04:31,110 INFO L87 Difference]: Start difference. First operand 391 states and 470 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:31,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:31,786 INFO L93 Difference]: Finished difference Result 1060 states and 1265 transitions. [2025-01-09 16:04:31,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:04:31,787 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2025-01-09 16:04:31,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:31,791 INFO L225 Difference]: With dead ends: 1060 [2025-01-09 16:04:31,791 INFO L226 Difference]: Without dead ends: 705 [2025-01-09 16:04:31,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:04:31,792 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 161 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:31,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 305 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:04:31,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-01-09 16:04:31,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 296. [2025-01-09 16:04:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 249 states have (on average 1.1325301204819278) internal successors, (282), 250 states have internal predecessors, (282), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 16:04:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 350 transitions. [2025-01-09 16:04:31,825 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 350 transitions. Word has length 120 [2025-01-09 16:04:31,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:31,825 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 350 transitions. [2025-01-09 16:04:31,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 350 transitions. [2025-01-09 16:04:31,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 16:04:31,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:31,827 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:31,837 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-01-09 16:04:32,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 16:04:32,031 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:32,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:32,032 INFO L85 PathProgramCache]: Analyzing trace with hash -687050261, now seen corresponding path program 1 times [2025-01-09 16:04:32,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:32,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307903627] [2025-01-09 16:04:32,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:32,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:32,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 16:04:32,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 16:04:32,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:32,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:04:32,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1771152777] [2025-01-09 16:04:32,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:32,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:32,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:32,113 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:04:32,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 16:04:32,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 16:04:32,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 16:04:32,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:32,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:32,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 16:04:32,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:32,387 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 70 treesize of output 69 [2025-01-09 16:04:32,600 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 91 treesize of output 83 [2025-01-09 16:04:32,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:32,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:32,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:32,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:32,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:32,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:32,773 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 41 treesize of output 1 [2025-01-09 16:04:32,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:04:32,787 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 19 treesize of output 19 [2025-01-09 16:04:32,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:32,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 53 [2025-01-09 16:04:33,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:33,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 23 [2025-01-09 16:04:33,195 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:04:33,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:33,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:33,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307903627] [2025-01-09 16:04:33,195 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:04:33,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771152777] [2025-01-09 16:04:33,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771152777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:33,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:33,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:04:33,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148147345] [2025-01-09 16:04:33,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:33,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:04:33,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:33,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:04:33,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:04:33,199 INFO L87 Difference]: Start difference. First operand 296 states and 350 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:35,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:35,310 INFO L93 Difference]: Finished difference Result 699 states and 828 transitions. [2025-01-09 16:04:35,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:04:35,311 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-01-09 16:04:35,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:35,314 INFO L225 Difference]: With dead ends: 699 [2025-01-09 16:04:35,314 INFO L226 Difference]: Without dead ends: 483 [2025-01-09 16:04:35,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:04:35,315 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 130 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:35,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 389 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 16:04:35,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-01-09 16:04:35,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 307. [2025-01-09 16:04:35,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 260 states have (on average 1.126923076923077) internal successors, (293), 261 states have internal predecessors, (293), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 16:04:35,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 361 transitions. [2025-01-09 16:04:35,339 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 361 transitions. Word has length 121 [2025-01-09 16:04:35,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:35,339 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 361 transitions. [2025-01-09 16:04:35,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:35,340 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 361 transitions. [2025-01-09 16:04:35,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 16:04:35,341 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:35,341 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:35,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 16:04:35,546 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,SelfDestructingSolverStorable17 [2025-01-09 16:04:35,546 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:35,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:35,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1709440130, now seen corresponding path program 1 times [2025-01-09 16:04:35,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:35,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109854602] [2025-01-09 16:04:35,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:35,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:35,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 16:04:35,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 16:04:35,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:35,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:04:36,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:36,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109854602] [2025-01-09 16:04:36,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109854602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:36,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:36,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:04:36,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105909005] [2025-01-09 16:04:36,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:36,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:04:36,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:36,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:04:36,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:04:36,297 INFO L87 Difference]: Start difference. First operand 307 states and 361 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:36,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:36,692 INFO L93 Difference]: Finished difference Result 538 states and 634 transitions. [2025-01-09 16:04:36,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:04:36,692 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2025-01-09 16:04:36,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:36,694 INFO L225 Difference]: With dead ends: 538 [2025-01-09 16:04:36,694 INFO L226 Difference]: Without dead ends: 322 [2025-01-09 16:04:36,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:04:36,695 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 59 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:36,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 791 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:04:36,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-01-09 16:04:36,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 319. [2025-01-09 16:04:36,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 269 states have (on average 1.1226765799256506) internal successors, (302), 270 states have internal predecessors, (302), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:04:36,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 374 transitions. [2025-01-09 16:04:36,729 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 374 transitions. Word has length 122 [2025-01-09 16:04:36,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:36,730 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 374 transitions. [2025-01-09 16:04:36,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 374 transitions. [2025-01-09 16:04:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 16:04:36,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:36,731 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:36,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 16:04:36,732 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:36,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:36,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1122634116, now seen corresponding path program 1 times [2025-01-09 16:04:36,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:36,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129263993] [2025-01-09 16:04:36,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:36,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:36,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 16:04:36,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 16:04:36,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:36,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:04:36,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1328133668] [2025-01-09 16:04:36,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:36,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:36,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:36,801 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:04:36,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 16:04:36,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 16:04:37,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 16:04:37,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:37,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:37,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 16:04:37,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:37,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:37,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:37,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:37,163 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 41 treesize of output 19 [2025-01-09 16:04:37,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:37,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2025-01-09 16:04:37,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:37,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2025-01-09 16:04:37,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:37,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 65 [2025-01-09 16:04:37,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:37,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 134 treesize of output 38 [2025-01-09 16:04:37,861 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:04:37,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:37,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:37,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129263993] [2025-01-09 16:04:37,862 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:04:37,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328133668] [2025-01-09 16:04:37,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328133668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:37,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:37,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:04:37,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95594975] [2025-01-09 16:04:37,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:37,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:04:37,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:37,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:04:37,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:04:37,864 INFO L87 Difference]: Start difference. First operand 319 states and 374 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:40,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-01-09 16:04:42,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:42,746 INFO L93 Difference]: Finished difference Result 661 states and 777 transitions. [2025-01-09 16:04:42,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:04:42,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2025-01-09 16:04:42,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:42,750 INFO L225 Difference]: With dead ends: 661 [2025-01-09 16:04:42,750 INFO L226 Difference]: Without dead ends: 433 [2025-01-09 16:04:42,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:04:42,752 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 220 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:42,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 379 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-01-09 16:04:42,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-01-09 16:04:42,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 324. [2025-01-09 16:04:42,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 274 states have (on average 1.1240875912408759) internal successors, (308), 275 states have internal predecessors, (308), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:04:42,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 380 transitions. [2025-01-09 16:04:42,782 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 380 transitions. Word has length 122 [2025-01-09 16:04:42,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:42,782 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 380 transitions. [2025-01-09 16:04:42,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:42,783 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 380 transitions. [2025-01-09 16:04:42,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 16:04:42,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:42,784 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:42,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 16:04:42,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:42,985 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:42,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:42,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1849988740, now seen corresponding path program 1 times [2025-01-09 16:04:42,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:42,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389913459] [2025-01-09 16:04:42,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:42,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:43,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 16:04:43,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 16:04:43,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:43,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:04:43,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1978614662] [2025-01-09 16:04:43,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:43,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:43,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:43,039 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:04:43,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 16:04:43,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 16:04:43,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 16:04:43,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:43,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:43,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 16:04:43,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:43,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:43,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:43,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:43,377 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 41 treesize of output 19 [2025-01-09 16:04:43,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:43,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2025-01-09 16:04:43,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:43,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2025-01-09 16:04:43,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:43,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 81 treesize of output 74 [2025-01-09 16:04:43,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:43,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 32 [2025-01-09 16:04:43,659 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:04:43,659 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:43,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:43,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389913459] [2025-01-09 16:04:43,659 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:04:43,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978614662] [2025-01-09 16:04:43,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978614662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:43,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:43,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:04:43,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388151069] [2025-01-09 16:04:43,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:43,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:04:43,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:43,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:04:43,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:04:43,660 INFO L87 Difference]: Start difference. First operand 324 states and 380 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:44,366 INFO L93 Difference]: Finished difference Result 721 states and 846 transitions. [2025-01-09 16:04:44,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:04:44,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2025-01-09 16:04:44,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:44,370 INFO L225 Difference]: With dead ends: 721 [2025-01-09 16:04:44,370 INFO L226 Difference]: Without dead ends: 488 [2025-01-09 16:04:44,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:04:44,372 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 179 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:44,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 425 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:04:44,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-01-09 16:04:44,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 336. [2025-01-09 16:04:44,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 286 states have (on average 1.1223776223776223) internal successors, (321), 287 states have internal predecessors, (321), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:04:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 393 transitions. [2025-01-09 16:04:44,408 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 393 transitions. Word has length 122 [2025-01-09 16:04:44,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:44,408 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 393 transitions. [2025-01-09 16:04:44,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:44,409 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 393 transitions. [2025-01-09 16:04:44,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 16:04:44,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:44,410 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:44,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 16:04:44,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:44,611 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:44,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:44,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1263182726, now seen corresponding path program 1 times [2025-01-09 16:04:44,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:44,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252825033] [2025-01-09 16:04:44,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:44,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:44,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 16:04:44,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 16:04:44,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:44,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:44,816 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 16:04:44,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:44,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252825033] [2025-01-09 16:04:44,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252825033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:44,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:44,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:04:44,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52634641] [2025-01-09 16:04:44,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:44,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:04:44,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:44,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:04:44,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:04:44,818 INFO L87 Difference]: Start difference. First operand 336 states and 393 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:45,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:45,055 INFO L93 Difference]: Finished difference Result 587 states and 688 transitions. [2025-01-09 16:04:45,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:04:45,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2025-01-09 16:04:45,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:45,058 INFO L225 Difference]: With dead ends: 587 [2025-01-09 16:04:45,058 INFO L226 Difference]: Without dead ends: 342 [2025-01-09 16:04:45,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:04:45,060 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 54 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:45,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 588 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:04:45,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-01-09 16:04:45,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 337. [2025-01-09 16:04:45,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 287 states have (on average 1.1219512195121952) internal successors, (322), 288 states have internal predecessors, (322), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:04:45,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 394 transitions. [2025-01-09 16:04:45,087 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 394 transitions. Word has length 122 [2025-01-09 16:04:45,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:45,087 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 394 transitions. [2025-01-09 16:04:45,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:45,088 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 394 transitions. [2025-01-09 16:04:45,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 16:04:45,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:45,089 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:45,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 16:04:45,089 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:45,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:45,090 INFO L85 PathProgramCache]: Analyzing trace with hash -321947486, now seen corresponding path program 1 times [2025-01-09 16:04:45,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:45,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778672101] [2025-01-09 16:04:45,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:45,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:45,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 16:04:45,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 16:04:45,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:45,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:45,696 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 16:04:45,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:45,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778672101] [2025-01-09 16:04:45,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778672101] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:04:45,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26783714] [2025-01-09 16:04:45,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:45,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:45,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:45,699 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:04:45,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 16:04:45,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 16:04:45,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 16:04:45,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:45,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:45,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 16:04:45,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:46,058 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 25 treesize of output 13 [2025-01-09 16:04:46,118 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 25 treesize of output 13 [2025-01-09 16:04:46,173 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 25 treesize of output 13 [2025-01-09 16:04:46,230 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 25 treesize of output 13 [2025-01-09 16:04:46,279 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 25 treesize of output 13 [2025-01-09 16:04:46,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 13 [2025-01-09 16:04:46,351 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 25 treesize of output 13 [2025-01-09 16:04:46,369 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 21 treesize of output 22 [2025-01-09 16:04:46,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:46,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 48 [2025-01-09 16:04:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2025-01-09 16:04:46,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:04:46,798 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 16:04:46,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26783714] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:04:46,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:04:46,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 22 [2025-01-09 16:04:46,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700557444] [2025-01-09 16:04:46,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:04:46,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 16:04:46,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:46,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 16:04:46,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2025-01-09 16:04:46,800 INFO L87 Difference]: Start difference. First operand 337 states and 394 transitions. Second operand has 22 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 22 states have internal predecessors, (137), 8 states have call successors, (39), 3 states have call predecessors, (39), 6 states have return successors, (39), 5 states have call predecessors, (39), 8 states have call successors, (39) [2025-01-09 16:04:47,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:47,815 INFO L93 Difference]: Finished difference Result 577 states and 661 transitions. [2025-01-09 16:04:47,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 16:04:47,816 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 22 states have internal predecessors, (137), 8 states have call successors, (39), 3 states have call predecessors, (39), 6 states have return successors, (39), 5 states have call predecessors, (39), 8 states have call successors, (39) Word has length 123 [2025-01-09 16:04:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:47,818 INFO L225 Difference]: With dead ends: 577 [2025-01-09 16:04:47,818 INFO L226 Difference]: Without dead ends: 292 [2025-01-09 16:04:47,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=335, Invalid=1305, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 16:04:47,820 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 164 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:47,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 308 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:04:47,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-01-09 16:04:47,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 286. [2025-01-09 16:04:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 231 states have (on average 1.0606060606060606) internal successors, (245), 232 states have internal predecessors, (245), 36 states have call successors, (36), 18 states have call predecessors, (36), 18 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:04:47,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 317 transitions. [2025-01-09 16:04:47,868 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 317 transitions. Word has length 123 [2025-01-09 16:04:47,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:47,868 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 317 transitions. [2025-01-09 16:04:47,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 22 states have internal predecessors, (137), 8 states have call successors, (39), 3 states have call predecessors, (39), 6 states have return successors, (39), 5 states have call predecessors, (39), 8 states have call successors, (39) [2025-01-09 16:04:47,869 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 317 transitions. [2025-01-09 16:04:47,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-01-09 16:04:47,871 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:47,871 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:47,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 16:04:48,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:48,072 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:48,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:48,072 INFO L85 PathProgramCache]: Analyzing trace with hash -653573155, now seen corresponding path program 1 times [2025-01-09 16:04:48,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:48,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863739332] [2025-01-09 16:04:48,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:48,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:48,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-09 16:04:48,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-09 16:04:48,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:48,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:04:48,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [436937999] [2025-01-09 16:04:48,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:48,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:48,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:48,251 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:04:48,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 16:04:48,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-09 16:04:48,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-09 16:04:48,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:48,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:48,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-01-09 16:04:48,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:48,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:48,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:48,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:48,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:48,755 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 41 treesize of output 1 [2025-01-09 16:04:48,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:04:48,760 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 19 treesize of output 19 [2025-01-09 16:04:48,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:48,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2025-01-09 16:04:48,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:48,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 10 [2025-01-09 16:04:48,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:48,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:48,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:48,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:48,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:48,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:48,878 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 41 treesize of output 1 [2025-01-09 16:04:48,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:04:48,882 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 19 treesize of output 19 [2025-01-09 16:04:48,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:48,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 69 [2025-01-09 16:04:49,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:49,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 26 [2025-01-09 16:04:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2025-01-09 16:04:49,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:04:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1549 trivial. 0 not checked. [2025-01-09 16:04:49,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:49,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863739332] [2025-01-09 16:04:49,445 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:04:49,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436937999] [2025-01-09 16:04:49,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436937999] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:04:49,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:04:49,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2025-01-09 16:04:49,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432736149] [2025-01-09 16:04:49,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:49,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:04:49,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:49,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:04:49,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:04:49,446 INFO L87 Difference]: Start difference. First operand 286 states and 317 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:49,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:49,866 INFO L93 Difference]: Finished difference Result 476 states and 525 transitions. [2025-01-09 16:04:49,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:04:49,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 236 [2025-01-09 16:04:49,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:49,869 INFO L225 Difference]: With dead ends: 476 [2025-01-09 16:04:49,869 INFO L226 Difference]: Without dead ends: 289 [2025-01-09 16:04:49,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:04:49,870 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 16 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:49,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 289 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:04:49,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-01-09 16:04:49,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 253. [2025-01-09 16:04:49,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 198 states have (on average 1.0404040404040404) internal successors, (206), 199 states have internal predecessors, (206), 36 states have call successors, (36), 18 states have call predecessors, (36), 18 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:04:49,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 278 transitions. [2025-01-09 16:04:49,902 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 278 transitions. Word has length 236 [2025-01-09 16:04:49,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:49,903 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 278 transitions. [2025-01-09 16:04:49,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:49,903 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 278 transitions. [2025-01-09 16:04:49,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-01-09 16:04:49,905 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:49,905 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:49,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 16:04:50,106 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,SelfDestructingSolverStorable23 [2025-01-09 16:04:50,106 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:50,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:50,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1311824171, now seen corresponding path program 1 times [2025-01-09 16:04:50,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:50,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331983983] [2025-01-09 16:04:50,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:50,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:50,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-01-09 16:04:50,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-01-09 16:04:50,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:50,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:04:50,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1695225702] [2025-01-09 16:04:50,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:50,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:50,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:50,278 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:04:50,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 16:04:50,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-01-09 16:04:50,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-01-09 16:04:50,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:50,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:50,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-09 16:04:50,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:50,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:50,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:50,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:50,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:50,863 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 41 treesize of output 1 [2025-01-09 16:04:50,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:04:50,867 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 19 treesize of output 19 [2025-01-09 16:04:50,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:50,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2025-01-09 16:04:50,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:50,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 10 [2025-01-09 16:04:50,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:50,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:50,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:50,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:50,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:50,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:50,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 41 treesize of output 1 [2025-01-09 16:04:50,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:04:50,984 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 19 treesize of output 19 [2025-01-09 16:04:51,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:51,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 51 [2025-01-09 16:04:51,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:51,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 21 [2025-01-09 16:04:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2025-01-09 16:04:51,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:04:51,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1549 trivial. 0 not checked. [2025-01-09 16:04:51,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:51,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331983983] [2025-01-09 16:04:51,416 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:04:51,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695225702] [2025-01-09 16:04:51,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695225702] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:04:51,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:04:51,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-01-09 16:04:51,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155380951] [2025-01-09 16:04:51,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:51,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:04:51,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:51,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:04:51,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:04:51,417 INFO L87 Difference]: Start difference. First operand 253 states and 278 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:51,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:51,949 INFO L93 Difference]: Finished difference Result 428 states and 466 transitions. [2025-01-09 16:04:51,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:04:51,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 237 [2025-01-09 16:04:51,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:51,951 INFO L225 Difference]: With dead ends: 428 [2025-01-09 16:04:51,951 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 16:04:51,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 464 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:04:51,952 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 30 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:51,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 189 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:04:51,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 16:04:51,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 16:04:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:04:51,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 16:04:51,956 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 237 [2025-01-09 16:04:51,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:51,956 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 16:04:51,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 16:04:51,956 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 16:04:51,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 16:04:51,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 16:04:51,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-09 16:04:52,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-09 16:04:52,164 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:52,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 16:05:00,912 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:05:00,920 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,921 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,921 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,921 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,921 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,921 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,922 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,922 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,922 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,923 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,923 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,923 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#WrapperStruct00~0!offset [2025-01-09 16:05:00,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2025-01-09 16:05:00,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#WrapperStruct00~0!offset [2025-01-09 16:05:00,926 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,926 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,926 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,926 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,926 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,926 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,926 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,927 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,927 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,927 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,927 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,927 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,927 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,928 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,928 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,928 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,928 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,928 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,928 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,928 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,928 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,929 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,929 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,929 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,929 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,929 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,929 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,929 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,929 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,929 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,929 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#WrapperStruct00~0!offset [2025-01-09 16:05:00,929 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,929 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,929 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,929 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,930 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,930 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,930 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,930 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,930 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,930 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,930 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,930 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,930 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,930 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,930 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,930 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,930 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,930 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,930 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,930 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,930 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,930 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 16:05:00,930 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 16:05:00,930 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-01-09 16:05:00,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:05:00 BoogieIcfgContainer [2025-01-09 16:05:00,933 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:05:00,933 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:05:00,934 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:05:00,934 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:05:00,935 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:04:13" (3/4) ... [2025-01-09 16:05:00,937 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 16:05:00,942 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-09 16:05:00,949 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-09 16:05:00,949 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 16:05:00,950 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 16:05:00,950 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 16:05:01,066 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:05:01,066 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:05:01,066 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:05:01,067 INFO L158 Benchmark]: Toolchain (without parser) took 48991.17ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 112.0MB in the beginning and 607.7MB in the end (delta: -495.7MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2025-01-09 16:05:01,068 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:05:01,068 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.62ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 96.4MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:05:01,068 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.55ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 93.3MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:05:01,069 INFO L158 Benchmark]: Boogie Preprocessor took 72.75ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 90.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:05:01,069 INFO L158 Benchmark]: RCFGBuilder took 585.31ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 63.8MB in the end (delta: 26.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 16:05:01,069 INFO L158 Benchmark]: TraceAbstraction took 47823.75ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 63.4MB in the beginning and 620.2MB in the end (delta: -556.9MB). Peak memory consumption was 354.8MB. Max. memory is 16.1GB. [2025-01-09 16:05:01,070 INFO L158 Benchmark]: Witness Printer took 133.10ms. Allocated memory is still 679.5MB. Free memory was 620.2MB in the beginning and 607.7MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:05:01,071 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.62ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 96.4MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.55ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 93.3MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 72.75ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 90.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 585.31ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 63.8MB in the end (delta: 26.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 47823.75ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 63.4MB in the beginning and 620.2MB in the end (delta: -556.9MB). Peak memory consumption was 354.8MB. Max. memory is 16.1GB. * Witness Printer took 133.10ms. Allocated memory is still 679.5MB. Free memory was 620.2MB in the beginning and 607.7MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#WrapperStruct00~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#WrapperStruct00~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#WrapperStruct00~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.0s, OverallIterations: 25, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2050 SdHoareTripleChecker+Valid, 13.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2028 mSDsluCounter, 10343 SdHoareTripleChecker+Invalid, 12.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7816 mSDsCounter, 365 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7887 IncrementalHoareTripleChecker+Invalid, 8252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 365 mSolverCounterUnsat, 2527 mSDtfsCounter, 7887 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2514 GetRequests, 2287 SyntacticMatches, 5 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=695occurred in iteration=13, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 1087 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 4686 NumberOfCodeBlocks, 4686 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 4406 ConstructedInterpolants, 0 QuantifiedInterpolants, 17707 SizeOfPredicates, 34 NumberOfNonLiveVariables, 4581 ConjunctsInSsa, 301 ConjunctsInUnsatCore, 34 InterpolantComputations, 23 PerfectInterpolantSequences, 16999/17204 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 16:05:01,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE