./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash cf0e38c8708298b6c669a06e84f1e143a32d8eb782624bd4425e7da323fbf6a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 05:15:12,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 05:15:12,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 05:15:12,894 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 05:15:12,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 05:15:12,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 05:15:12,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 05:15:12,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 05:15:12,917 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 05:15:12,917 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 05:15:12,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 05:15:12,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 05:15:12,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 05:15:12,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 05:15:12,918 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 05:15:12,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 05:15:12,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 05:15:12,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 05:15:12,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 05:15:12,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 05:15:12,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 05:15:12,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 05:15:12,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 05:15:12,919 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 05:15:12,919 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 05:15:12,919 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 05:15:12,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 05:15:12,919 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 05:15:12,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 05:15:12,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:15:12,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 05:15:12,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 05:15:12,919 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 05:15:12,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 05:15:12,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 05:15:12,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 05:15:12,920 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 05:15:12,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 05:15:12,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 05:15:12,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 05:15:12,920 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cf0e38c8708298b6c669a06e84f1e143a32d8eb782624bd4425e7da323fbf6a8 [2025-02-06 05:15:13,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 05:15:13,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 05:15:13,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 05:15:13,158 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 05:15:13,158 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 05:15:13,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i [2025-02-06 05:15:14,389 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08f6d9c44/6b662d9386654f2e86928506c804108c/FLAG0385538b8 [2025-02-06 05:15:14,794 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 05:15:14,794 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i [2025-02-06 05:15:14,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08f6d9c44/6b662d9386654f2e86928506c804108c/FLAG0385538b8 [2025-02-06 05:15:14,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08f6d9c44/6b662d9386654f2e86928506c804108c [2025-02-06 05:15:14,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 05:15:14,960 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 05:15:14,961 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 05:15:14,961 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 05:15:14,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 05:15:14,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:15:14" (1/1) ... [2025-02-06 05:15:14,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5767d2ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:15:14, skipping insertion in model container [2025-02-06 05:15:14,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:15:14" (1/1) ... [2025-02-06 05:15:15,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 05:15:15,155 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/aws-c-common/aws_linked_list_begin_harness_negated.i[4495,4508] [2025-02-06 05:15:15,159 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/aws-c-common/aws_linked_list_begin_harness_negated.i[4555,4568] [2025-02-06 05:15:15,540 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,541 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,541 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,542 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,543 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,554 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,555 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,556 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,557 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,559 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,560 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,560 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,561 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,857 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/aws-c-common/aws_linked_list_begin_harness_negated.i[150686,150699] [2025-02-06 05:15:15,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:15:15,877 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 05:15:15,890 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/aws-c-common/aws_linked_list_begin_harness_negated.i[4495,4508] [2025-02-06 05:15:15,890 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/aws-c-common/aws_linked_list_begin_harness_negated.i[4555,4568] [2025-02-06 05:15:15,939 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,939 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,939 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,940 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,940 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,951 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,952 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,952 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,953 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,953 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,954 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,954 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:15,954 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:15:16,032 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/aws-c-common/aws_linked_list_begin_harness_negated.i[150686,150699] [2025-02-06 05:15:16,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:15:16,155 INFO L204 MainTranslator]: Completed translation [2025-02-06 05:15:16,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:15:16 WrapperNode [2025-02-06 05:15:16,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 05:15:16,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 05:15:16,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 05:15:16,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 05:15:16,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:15:16" (1/1) ... [2025-02-06 05:15:16,201 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:15:16" (1/1) ... [2025-02-06 05:15:16,247 INFO L138 Inliner]: procedures = 668, calls = 1039, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 137 [2025-02-06 05:15:16,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 05:15:16,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 05:15:16,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 05:15:16,248 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 05:15:16,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:15:16" (1/1) ... [2025-02-06 05:15:16,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:15:16" (1/1) ... [2025-02-06 05:15:16,256 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:15:16" (1/1) ... [2025-02-06 05:15:16,274 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 5, 17]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2025-02-06 05:15:16,275 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:15:16" (1/1) ... [2025-02-06 05:15:16,275 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:15:16" (1/1) ... [2025-02-06 05:15:16,286 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:15:16" (1/1) ... [2025-02-06 05:15:16,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:15:16" (1/1) ... [2025-02-06 05:15:16,289 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:15:16" (1/1) ... [2025-02-06 05:15:16,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:15:16" (1/1) ... [2025-02-06 05:15:16,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 05:15:16,293 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 05:15:16,293 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 05:15:16,293 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 05:15:16,293 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:15:16" (1/1) ... [2025-02-06 05:15:16,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:15:16,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:15:16,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 05:15:16,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 05:15:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 05:15:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 05:15:16,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 05:15:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-02-06 05:15:16,342 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-02-06 05:15:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 05:15:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-02-06 05:15:16,342 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-02-06 05:15:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 05:15:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 05:15:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 05:15:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 05:15:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 05:15:16,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 05:15:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 05:15:16,342 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 05:15:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 05:15:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 05:15:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 05:15:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 05:15:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 05:15:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 05:15:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 05:15:16,343 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-02-06 05:15:16,343 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-02-06 05:15:16,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 05:15:16,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 05:15:16,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 05:15:16,509 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 05:15:16,510 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 05:15:16,542 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4718: havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; [2025-02-06 05:15:16,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-02-06 05:15:16,677 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-02-06 05:15:16,705 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-02-06 05:15:16,705 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 05:15:16,711 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 05:15:16,711 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 05:15:16,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:15:16 BoogieIcfgContainer [2025-02-06 05:15:16,711 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 05:15:16,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 05:15:16,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 05:15:16,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 05:15:16,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:15:14" (1/3) ... [2025-02-06 05:15:16,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f0666c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:15:16, skipping insertion in model container [2025-02-06 05:15:16,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:15:16" (2/3) ... [2025-02-06 05:15:16,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f0666c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:15:16, skipping insertion in model container [2025-02-06 05:15:16,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:15:16" (3/3) ... [2025-02-06 05:15:16,717 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_begin_harness_negated.i [2025-02-06 05:15:16,727 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 05:15:16,728 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_begin_harness_negated.i that has 6 procedures, 68 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-06 05:15:16,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 05:15:16,767 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;@6b2e2120, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 05:15:16,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 05:15:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 05:15:16,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 05:15:16,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:15:16,776 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:15:16,776 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:15:16,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:15:16,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1751692032, now seen corresponding path program 1 times [2025-02-06 05:15:16,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:15:16,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694332338] [2025-02-06 05:15:16,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:16,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:15:16,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 05:15:16,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 05:15:16,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:16,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:17,070 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-06 05:15:17,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:15:17,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694332338] [2025-02-06 05:15:17,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694332338] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:15:17,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93786348] [2025-02-06 05:15:17,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:17,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:15:17,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:15:17,074 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:15:17,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 05:15:17,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 05:15:17,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 05:15:17,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:17,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:17,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 05:15:17,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:15:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-06 05:15:17,255 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:15:17,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93786348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:15:17,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:15:17,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 05:15:17,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171392240] [2025-02-06 05:15:17,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:15:17,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 05:15:17,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:15:17,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 05:15:17,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 05:15:17,275 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:15:17,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:15:17,294 INFO L93 Difference]: Finished difference Result 128 states and 176 transitions. [2025-02-06 05:15:17,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 05:15:17,295 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-02-06 05:15:17,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:15:17,301 INFO L225 Difference]: With dead ends: 128 [2025-02-06 05:15:17,301 INFO L226 Difference]: Without dead ends: 63 [2025-02-06 05:15:17,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 05:15:17,306 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:15:17,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:15:17,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-06 05:15:17,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-06 05:15:17,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 05:15:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2025-02-06 05:15:17,336 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 70 [2025-02-06 05:15:17,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:15:17,338 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2025-02-06 05:15:17,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:15:17,339 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2025-02-06 05:15:17,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 05:15:17,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:15:17,340 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:15:17,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 05:15:17,541 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-02-06 05:15:17,541 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:15:17,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:15:17,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2037040671, now seen corresponding path program 1 times [2025-02-06 05:15:17,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:15:17,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930554961] [2025-02-06 05:15:17,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:17,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:15:17,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 05:15:17,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 05:15:17,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:17,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-06 05:15:18,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:15:18,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930554961] [2025-02-06 05:15:18,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930554961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:15:18,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:15:18,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 05:15:18,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446629614] [2025-02-06 05:15:18,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:15:18,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 05:15:18,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:15:18,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 05:15:18,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 05:15:18,138 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 05:15:18,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:15:18,180 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2025-02-06 05:15:18,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 05:15:18,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 70 [2025-02-06 05:15:18,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:15:18,184 INFO L225 Difference]: With dead ends: 73 [2025-02-06 05:15:18,184 INFO L226 Difference]: Without dead ends: 71 [2025-02-06 05:15:18,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-02-06 05:15:18,185 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 3 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:15:18,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 387 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:15:18,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-06 05:15:18,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-02-06 05:15:18,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-02-06 05:15:18,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2025-02-06 05:15:18,198 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 70 [2025-02-06 05:15:18,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:15:18,198 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2025-02-06 05:15:18,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 05:15:18,199 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2025-02-06 05:15:18,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 05:15:18,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:15:18,200 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:15:18,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 05:15:18,200 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:15:18,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:15:18,200 INFO L85 PathProgramCache]: Analyzing trace with hash -323042944, now seen corresponding path program 1 times [2025-02-06 05:15:18,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:15:18,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647698327] [2025-02-06 05:15:18,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:18,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:15:18,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 05:15:18,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 05:15:18,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:18,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 05:15:18,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:15:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647698327] [2025-02-06 05:15:18,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647698327] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:15:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371217718] [2025-02-06 05:15:18,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:18,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:15:18,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:15:18,564 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:15:18,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 05:15:18,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 05:15:18,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 05:15:18,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:18,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:18,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 05:15:18,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:15:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 05:15:18,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:15:18,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371217718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:15:18,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:15:18,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2025-02-06 05:15:18,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439857010] [2025-02-06 05:15:18,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:15:18,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 05:15:18,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:15:18,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 05:15:18,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-02-06 05:15:18,838 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:15:19,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:15:19,028 INFO L93 Difference]: Finished difference Result 133 states and 176 transitions. [2025-02-06 05:15:19,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 05:15:19,029 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2025-02-06 05:15:19,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:15:19,030 INFO L225 Difference]: With dead ends: 133 [2025-02-06 05:15:19,031 INFO L226 Difference]: Without dead ends: 72 [2025-02-06 05:15:19,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-02-06 05:15:19,033 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 94 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:15:19,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 303 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:15:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-06 05:15:19,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2025-02-06 05:15:19,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-02-06 05:15:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2025-02-06 05:15:19,045 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 71 [2025-02-06 05:15:19,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:15:19,045 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2025-02-06 05:15:19,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:15:19,046 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2025-02-06 05:15:19,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 05:15:19,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:15:19,047 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:15:19,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 05:15:19,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:15:19,248 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:15:19,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:15:19,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1128611816, now seen corresponding path program 1 times [2025-02-06 05:15:19,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:15:19,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936829434] [2025-02-06 05:15:19,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:19,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:15:19,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 05:15:19,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 05:15:19,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:19,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:19,561 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 05:15:19,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:15:19,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936829434] [2025-02-06 05:15:19,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936829434] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:15:19,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569700506] [2025-02-06 05:15:19,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:19,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:15:19,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:15:19,566 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:15:19,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 05:15:19,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 05:15:19,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 05:15:19,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:19,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:19,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 05:15:19,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:15:19,820 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 05:15:19,820 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:15:19,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569700506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:15:19,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:15:19,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2025-02-06 05:15:19,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338725050] [2025-02-06 05:15:19,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:15:19,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 05:15:19,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:15:19,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 05:15:19,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2025-02-06 05:15:19,822 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:15:20,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:15:20,045 INFO L93 Difference]: Finished difference Result 139 states and 184 transitions. [2025-02-06 05:15:20,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 05:15:20,046 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2025-02-06 05:15:20,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:15:20,049 INFO L225 Difference]: With dead ends: 139 [2025-02-06 05:15:20,049 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 05:15:20,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2025-02-06 05:15:20,051 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 108 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:15:20,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 338 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:15:20,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 05:15:20,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2025-02-06 05:15:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 51 states have internal predecessors, (61), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-02-06 05:15:20,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2025-02-06 05:15:20,065 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 73 [2025-02-06 05:15:20,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:15:20,065 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2025-02-06 05:15:20,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:15:20,066 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2025-02-06 05:15:20,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 05:15:20,066 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:15:20,066 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:15:20,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 05:15:20,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:15:20,267 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:15:20,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:15:20,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2019669804, now seen corresponding path program 1 times [2025-02-06 05:15:20,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:15:20,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585362564] [2025-02-06 05:15:20,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:20,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:15:20,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 05:15:20,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 05:15:20,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:20,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 05:15:20,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:15:20,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585362564] [2025-02-06 05:15:20,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585362564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:15:20,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:15:20,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 05:15:20,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511730210] [2025-02-06 05:15:20,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:15:20,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 05:15:20,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:15:20,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 05:15:20,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 05:15:20,472 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:15:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:15:20,589 INFO L93 Difference]: Finished difference Result 140 states and 184 transitions. [2025-02-06 05:15:20,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 05:15:20,590 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 74 [2025-02-06 05:15:20,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:15:20,591 INFO L225 Difference]: With dead ends: 140 [2025-02-06 05:15:20,591 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 05:15:20,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 05:15:20,592 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 27 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:15:20,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 400 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:15:20,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 05:15:20,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2025-02-06 05:15:20,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.24) internal successors, (62), 52 states have internal predecessors, (62), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-02-06 05:15:20,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2025-02-06 05:15:20,598 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 74 [2025-02-06 05:15:20,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:15:20,598 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2025-02-06 05:15:20,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:15:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2025-02-06 05:15:20,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 05:15:20,599 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:15:20,599 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:15:20,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 05:15:20,600 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:15:20,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:15:20,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1723672053, now seen corresponding path program 1 times [2025-02-06 05:15:20,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:15:20,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915951680] [2025-02-06 05:15:20,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:20,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:15:20,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 05:15:20,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 05:15:20,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:20,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:20,864 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 05:15:20,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:15:20,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915951680] [2025-02-06 05:15:20,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915951680] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:15:20,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386332977] [2025-02-06 05:15:20,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:20,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:15:20,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:15:20,866 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:15:20,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 05:15:20,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 05:15:20,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 05:15:20,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:20,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:20,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 05:15:21,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:15:21,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-02-06 05:15:21,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-02-06 05:15:21,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:21,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:21,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2025-02-06 05:15:21,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:21,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:21,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:21,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2025-02-06 05:15:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 05:15:21,559 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:15:21,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386332977] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:15:21,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:15:21,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2025-02-06 05:15:21,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754628841] [2025-02-06 05:15:21,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:15:21,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 05:15:21,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:15:21,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 05:15:21,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-06 05:15:21,561 INFO L87 Difference]: Start difference. First operand 72 states and 93 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-06 05:15:21,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:15:21,941 INFO L93 Difference]: Finished difference Result 199 states and 261 transitions. [2025-02-06 05:15:21,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 05:15:21,942 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), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 82 [2025-02-06 05:15:21,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:15:21,943 INFO L225 Difference]: With dead ends: 199 [2025-02-06 05:15:21,943 INFO L226 Difference]: Without dead ends: 139 [2025-02-06 05:15:21,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-06 05:15:21,944 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 49 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 05:15:21,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 362 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 05:15:21,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-06 05:15:21,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2025-02-06 05:15:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 96 states have (on average 1.2604166666666667) internal successors, (121), 101 states have internal predecessors, (121), 26 states have call successors, (26), 11 states have call predecessors, (26), 14 states have return successors, (34), 24 states have call predecessors, (34), 24 states have call successors, (34) [2025-02-06 05:15:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 181 transitions. [2025-02-06 05:15:21,970 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 181 transitions. Word has length 82 [2025-02-06 05:15:21,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:15:21,970 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 181 transitions. [2025-02-06 05:15:21,970 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), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-06 05:15:21,970 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 181 transitions. [2025-02-06 05:15:21,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 05:15:21,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:15:21,972 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:15:21,979 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-02-06 05:15:22,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-06 05:15:22,176 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:15:22,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:15:22,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1443322164, now seen corresponding path program 1 times [2025-02-06 05:15:22,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:15:22,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332865650] [2025-02-06 05:15:22,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:22,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:15:22,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 05:15:22,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 05:15:22,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:22,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:22,411 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 05:15:22,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:15:22,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332865650] [2025-02-06 05:15:22,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332865650] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:15:22,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101325772] [2025-02-06 05:15:22,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:22,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:15:22,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:15:22,414 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:15:22,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 05:15:22,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 05:15:22,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 05:15:22,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:22,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:22,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-02-06 05:15:22,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:15:22,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-02-06 05:15:22,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-02-06 05:15:23,036 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 05:15:23,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:15:23,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101325772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:15:23,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:15:23,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2025-02-06 05:15:23,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957132034] [2025-02-06 05:15:23,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:15:23,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 05:15:23,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:15:23,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 05:15:23,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-02-06 05:15:23,040 INFO L87 Difference]: Start difference. First operand 137 states and 181 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-06 05:15:23,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:15:23,564 INFO L93 Difference]: Finished difference Result 220 states and 294 transitions. [2025-02-06 05:15:23,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 05:15:23,564 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 82 [2025-02-06 05:15:23,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:15:23,566 INFO L225 Difference]: With dead ends: 220 [2025-02-06 05:15:23,566 INFO L226 Difference]: Without dead ends: 156 [2025-02-06 05:15:23,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2025-02-06 05:15:23,567 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 207 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 05:15:23,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 402 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 05:15:23,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-06 05:15:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2025-02-06 05:15:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 114 states have internal predecessors, (138), 27 states have call successors, (27), 11 states have call predecessors, (27), 15 states have return successors, (37), 25 states have call predecessors, (37), 25 states have call successors, (37) [2025-02-06 05:15:23,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 202 transitions. [2025-02-06 05:15:23,583 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 202 transitions. Word has length 82 [2025-02-06 05:15:23,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:15:23,583 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 202 transitions. [2025-02-06 05:15:23,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-06 05:15:23,584 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 202 transitions. [2025-02-06 05:15:23,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 05:15:23,584 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:15:23,584 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:15:23,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 05:15:23,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:15:23,788 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:15:23,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:15:23,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1684948813, now seen corresponding path program 1 times [2025-02-06 05:15:23,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:15:23,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650532933] [2025-02-06 05:15:23,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:23,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:15:23,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 05:15:23,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 05:15:23,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:23,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:23,982 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 05:15:23,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:15:23,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650532933] [2025-02-06 05:15:23,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650532933] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:15:23,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688780223] [2025-02-06 05:15:23,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:23,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:15:23,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:15:23,984 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:15:23,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 05:15:24,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 05:15:24,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 05:15:24,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:24,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:24,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 05:15:24,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:15:24,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-02-06 05:15:24,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-02-06 05:15:24,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:24,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:24,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:24,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2025-02-06 05:15:24,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:24,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:24,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2025-02-06 05:15:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 05:15:24,624 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:15:24,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688780223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:15:24,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:15:24,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-02-06 05:15:24,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180254589] [2025-02-06 05:15:24,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:15:24,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 05:15:24,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:15:24,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 05:15:24,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-06 05:15:24,625 INFO L87 Difference]: Start difference. First operand 151 states and 202 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-06 05:15:25,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:15:25,270 INFO L93 Difference]: Finished difference Result 254 states and 345 transitions. [2025-02-06 05:15:25,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 05:15:25,271 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 82 [2025-02-06 05:15:25,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:15:25,273 INFO L225 Difference]: With dead ends: 254 [2025-02-06 05:15:25,273 INFO L226 Difference]: Without dead ends: 176 [2025-02-06 05:15:25,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-02-06 05:15:25,274 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 76 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 05:15:25,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 475 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 05:15:25,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-02-06 05:15:25,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 155. [2025-02-06 05:15:25,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 112 states have (on average 1.2857142857142858) internal successors, (144), 118 states have internal predecessors, (144), 27 states have call successors, (27), 11 states have call predecessors, (27), 15 states have return successors, (37), 25 states have call predecessors, (37), 25 states have call successors, (37) [2025-02-06 05:15:25,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 208 transitions. [2025-02-06 05:15:25,293 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 208 transitions. Word has length 82 [2025-02-06 05:15:25,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:15:25,293 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 208 transitions. [2025-02-06 05:15:25,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-06 05:15:25,294 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 208 transitions. [2025-02-06 05:15:25,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 05:15:25,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:15:25,294 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:15:25,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 05:15:25,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-06 05:15:25,495 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:15:25,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:15:25,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1476250510, now seen corresponding path program 1 times [2025-02-06 05:15:25,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:15:25,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067966260] [2025-02-06 05:15:25,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:25,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:15:25,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 05:15:25,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 05:15:25,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:25,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:25,873 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 05:15:25,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:15:25,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067966260] [2025-02-06 05:15:25,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067966260] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:15:25,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427095396] [2025-02-06 05:15:25,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:25,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:15:25,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:15:25,875 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:15:25,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 05:15:25,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 05:15:26,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 05:15:26,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:26,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:26,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-02-06 05:15:26,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:15:26,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 05:15:26,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 05:15:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:15:26,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:15:26,992 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 05:15:26,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427095396] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:15:26,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:15:26,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 12] total 31 [2025-02-06 05:15:26,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133878196] [2025-02-06 05:15:26,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:15:26,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 05:15:26,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:15:26,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 05:15:26,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2025-02-06 05:15:26,994 INFO L87 Difference]: Start difference. First operand 155 states and 208 transitions. Second operand has 31 states, 29 states have (on average 4.344827586206897) internal successors, (126), 29 states have internal predecessors, (126), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 6 states have call predecessors, (21), 10 states have call successors, (21) [2025-02-06 05:15:28,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:15:28,591 INFO L93 Difference]: Finished difference Result 574 states and 823 transitions. [2025-02-06 05:15:28,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-06 05:15:28,591 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 4.344827586206897) internal successors, (126), 29 states have internal predecessors, (126), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 6 states have call predecessors, (21), 10 states have call successors, (21) Word has length 82 [2025-02-06 05:15:28,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:15:28,594 INFO L225 Difference]: With dead ends: 574 [2025-02-06 05:15:28,594 INFO L226 Difference]: Without dead ends: 437 [2025-02-06 05:15:28,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 154 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2025-02-06 05:15:28,597 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 289 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 05:15:28,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1689 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 05:15:28,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-02-06 05:15:28,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 311. [2025-02-06 05:15:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 235 states have (on average 1.297872340425532) internal successors, (305), 248 states have internal predecessors, (305), 46 states have call successors, (46), 18 states have call predecessors, (46), 29 states have return successors, (76), 44 states have call predecessors, (76), 43 states have call successors, (76) [2025-02-06 05:15:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 427 transitions. [2025-02-06 05:15:28,642 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 427 transitions. Word has length 82 [2025-02-06 05:15:28,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:15:28,643 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 427 transitions. [2025-02-06 05:15:28,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 4.344827586206897) internal successors, (126), 29 states have internal predecessors, (126), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 6 states have call predecessors, (21), 10 states have call successors, (21) [2025-02-06 05:15:28,643 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 427 transitions. [2025-02-06 05:15:28,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 05:15:28,644 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:15:28,645 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:15:28,652 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-02-06 05:15:28,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:15:28,849 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:15:28,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:15:28,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1514323057, now seen corresponding path program 1 times [2025-02-06 05:15:28,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:15:28,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889835349] [2025-02-06 05:15:28,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:28,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:15:28,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 05:15:28,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 05:15:28,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:28,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:28,954 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 05:15:28,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:15:28,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889835349] [2025-02-06 05:15:28,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889835349] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:15:28,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759150748] [2025-02-06 05:15:28,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:28,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:15:28,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:15:28,956 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:15:28,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 05:15:29,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 05:15:29,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 05:15:29,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:29,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:29,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 05:15:29,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:15:29,156 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 05:15:29,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:15:29,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759150748] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:15:29,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:15:29,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2025-02-06 05:15:29,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924287577] [2025-02-06 05:15:29,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:15:29,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 05:15:29,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:15:29,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 05:15:29,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 05:15:29,159 INFO L87 Difference]: Start difference. First operand 311 states and 427 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 05:15:29,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:15:29,270 INFO L93 Difference]: Finished difference Result 627 states and 875 transitions. [2025-02-06 05:15:29,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 05:15:29,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 82 [2025-02-06 05:15:29,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:15:29,273 INFO L225 Difference]: With dead ends: 627 [2025-02-06 05:15:29,274 INFO L226 Difference]: Without dead ends: 384 [2025-02-06 05:15:29,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 05:15:29,278 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 101 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:15:29,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 223 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:15:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-02-06 05:15:29,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 345. [2025-02-06 05:15:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 264 states have (on average 1.303030303030303) internal successors, (344), 280 states have internal predecessors, (344), 48 states have call successors, (48), 18 states have call predecessors, (48), 32 states have return successors, (82), 46 states have call predecessors, (82), 45 states have call successors, (82) [2025-02-06 05:15:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 474 transitions. [2025-02-06 05:15:29,313 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 474 transitions. Word has length 82 [2025-02-06 05:15:29,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:15:29,313 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 474 transitions. [2025-02-06 05:15:29,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 05:15:29,313 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 474 transitions. [2025-02-06 05:15:29,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-06 05:15:29,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:15:29,317 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:15:29,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 05:15:29,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:15:29,518 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:15:29,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:15:29,518 INFO L85 PathProgramCache]: Analyzing trace with hash 589612240, now seen corresponding path program 1 times [2025-02-06 05:15:29,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:15:29,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378499414] [2025-02-06 05:15:29,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:29,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:15:29,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 05:15:29,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 05:15:29,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:29,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:29,694 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-06 05:15:29,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:15:29,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378499414] [2025-02-06 05:15:29,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378499414] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:15:29,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946931625] [2025-02-06 05:15:29,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:29,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:15:29,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:15:29,697 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:15:29,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 05:15:29,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 05:15:29,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 05:15:29,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:29,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:29,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-06 05:15:29,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:15:29,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-02-06 05:15:29,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-02-06 05:15:29,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:29,950 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-02-06 05:15:29,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:29,955 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 18 treesize of output 13 [2025-02-06 05:15:29,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:29,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:29,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2025-02-06 05:15:29,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:29,980 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 34 treesize of output 25 [2025-02-06 05:15:30,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:30,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 52 [2025-02-06 05:15:30,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 05:15:30,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:30,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:30,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:30,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:30,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 35 [2025-02-06 05:15:30,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:30,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:30,738 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 05:15:30,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 47 [2025-02-06 05:15:30,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:30,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:30,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:30,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:30,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:30,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:30,836 INFO L349 Elim1Store]: treesize reduction 120, result has 44.7 percent of original size [2025-02-06 05:15:30,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 73 treesize of output 125 [2025-02-06 05:15:30,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 97 [2025-02-06 05:15:30,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 11 [2025-02-06 05:15:30,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 05:15:30,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 05:15:30,916 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 05:15:30,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:15:31,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:15:31,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 96 [2025-02-06 05:15:31,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:15:31,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2025-02-06 05:15:31,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-06 05:15:31,297 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 16))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| 1)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_subst_1 Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| 0)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| v_arrayElimArr_5))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_1))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse2) 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| 1)) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_subst_2 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_4 v_subst_2))) (forall ((v_ArrVal_718 Int) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_715 Int)) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_715)))) (store (store .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| v_ArrVal_719) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| v_arrayElimArr_4) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_718))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse2) 0)))))))) is different from false [2025-02-06 05:15:31,312 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:15:31,313 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:15:31,368 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-02-06 05:15:31,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 177 treesize of output 206 [2025-02-06 05:15:31,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:15:31,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 226 treesize of output 226 [2025-02-06 05:15:31,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:15:31,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 193 treesize of output 194 [2025-02-06 05:15:31,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 179 [2025-02-06 05:15:31,412 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:15:31,412 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:15:31,467 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-02-06 05:15:31,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 377 treesize of output 364 [2025-02-06 05:15:31,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:15:31,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 318 treesize of output 314 [2025-02-06 05:15:31,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 255 [2025-02-06 05:15:31,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-02-06 05:15:32,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:15:32,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 74 [2025-02-06 05:15:32,218 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:15:32,223 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:15:32,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2025-02-06 05:15:32,255 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2025-02-06 05:15:32,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946931625] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:15:32,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:15:32,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 21 [2025-02-06 05:15:32,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733989641] [2025-02-06 05:15:32,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:15:32,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 05:15:32,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:15:32,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 05:15:32,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=309, Unknown=20, NotChecked=36, Total=420 [2025-02-06 05:15:32,257 INFO L87 Difference]: Start difference. First operand 345 states and 474 transitions. Second operand has 21 states, 20 states have (on average 5.3) internal successors, (106), 19 states have internal predecessors, (106), 7 states have call successors, (23), 3 states have call predecessors, (23), 6 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22) [2025-02-06 05:15:33,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:15:33,615 INFO L93 Difference]: Finished difference Result 791 states and 1083 transitions. [2025-02-06 05:15:33,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 05:15:33,616 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.3) internal successors, (106), 19 states have internal predecessors, (106), 7 states have call successors, (23), 3 states have call predecessors, (23), 6 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22) Word has length 83 [2025-02-06 05:15:33,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:15:33,619 INFO L225 Difference]: With dead ends: 791 [2025-02-06 05:15:33,620 INFO L226 Difference]: Without dead ends: 434 [2025-02-06 05:15:33,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=133, Invalid=776, Unknown=25, NotChecked=58, Total=992 [2025-02-06 05:15:33,621 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 62 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 19 mSolverCounterUnsat, 91 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 91 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 05:15:33,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 988 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 544 Invalid, 91 Unknown, 141 Unchecked, 0.9s Time] [2025-02-06 05:15:33,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-02-06 05:15:33,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 398. [2025-02-06 05:15:33,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 311 states have (on average 1.315112540192926) internal successors, (409), 329 states have internal predecessors, (409), 50 states have call successors, (50), 20 states have call predecessors, (50), 36 states have return successors, (77), 48 states have call predecessors, (77), 47 states have call successors, (77) [2025-02-06 05:15:33,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 536 transitions. [2025-02-06 05:15:33,657 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 536 transitions. Word has length 83 [2025-02-06 05:15:33,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:15:33,658 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 536 transitions. [2025-02-06 05:15:33,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.3) internal successors, (106), 19 states have internal predecessors, (106), 7 states have call successors, (23), 3 states have call predecessors, (23), 6 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22) [2025-02-06 05:15:33,658 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 536 transitions. [2025-02-06 05:15:33,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 05:15:33,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:15:33,661 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:15:33,669 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-02-06 05:15:33,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:15:33,862 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:15:33,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:15:33,863 INFO L85 PathProgramCache]: Analyzing trace with hash 214263079, now seen corresponding path program 1 times [2025-02-06 05:15:33,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:15:33,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224551191] [2025-02-06 05:15:33,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:33,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:15:33,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 05:15:33,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 05:15:33,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:33,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:34,138 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-06 05:15:34,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:15:34,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224551191] [2025-02-06 05:15:34,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224551191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:15:34,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:15:34,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 05:15:34,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042337014] [2025-02-06 05:15:34,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:15:34,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 05:15:34,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:15:34,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 05:15:34,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 05:15:34,140 INFO L87 Difference]: Start difference. First operand 398 states and 536 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 05:15:34,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:15:34,212 INFO L93 Difference]: Finished difference Result 454 states and 609 transitions. [2025-02-06 05:15:34,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 05:15:34,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 95 [2025-02-06 05:15:34,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:15:34,214 INFO L225 Difference]: With dead ends: 454 [2025-02-06 05:15:34,215 INFO L226 Difference]: Without dead ends: 452 [2025-02-06 05:15:34,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 05:15:34,215 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 3 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:15:34,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 452 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:15:34,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-02-06 05:15:34,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 424. [2025-02-06 05:15:34,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 329 states have (on average 1.297872340425532) internal successors, (427), 355 states have internal predecessors, (427), 50 states have call successors, (50), 20 states have call predecessors, (50), 44 states have return successors, (100), 48 states have call predecessors, (100), 47 states have call successors, (100) [2025-02-06 05:15:34,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 577 transitions. [2025-02-06 05:15:34,273 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 577 transitions. Word has length 95 [2025-02-06 05:15:34,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:15:34,274 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 577 transitions. [2025-02-06 05:15:34,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 05:15:34,275 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 577 transitions. [2025-02-06 05:15:34,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 05:15:34,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:15:34,278 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:15:34,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 05:15:34,278 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:15:34,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:15:34,279 INFO L85 PathProgramCache]: Analyzing trace with hash -441000465, now seen corresponding path program 1 times [2025-02-06 05:15:34,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:15:34,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497954142] [2025-02-06 05:15:34,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:34,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:15:34,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 05:15:34,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 05:15:34,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:34,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-06 05:15:34,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:15:34,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497954142] [2025-02-06 05:15:34,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497954142] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:15:34,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303649399] [2025-02-06 05:15:34,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:34,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:15:34,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:15:34,549 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:15:34,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 05:15:34,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 05:15:34,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 05:15:34,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:34,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:34,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-02-06 05:15:34,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:15:34,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:34,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-06 05:15:34,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:34,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-06 05:15:34,845 INFO L349 Elim1Store]: treesize reduction 40, result has 14.9 percent of original size [2025-02-06 05:15:34,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 108 [2025-02-06 05:15:34,863 INFO L349 Elim1Store]: treesize reduction 48, result has 9.4 percent of original size [2025-02-06 05:15:34,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 125 [2025-02-06 05:15:34,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:15:34,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 30 [2025-02-06 05:15:34,875 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 33 treesize of output 19 [2025-02-06 05:15:34,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 38 treesize of output 38 [2025-02-06 05:15:34,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-02-06 05:15:34,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2025-02-06 05:15:35,846 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 05:15:35,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:16:02,255 INFO L349 Elim1Store]: treesize reduction 144, result has 41.7 percent of original size [2025-02-06 05:16:02,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 419 treesize of output 402 [2025-02-06 05:16:02,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:16:02,478 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 167568 treesize of output 160811 [2025-02-06 05:16:09,798 WARN L286 SmtUtils]: Spent 7.32s on a formula simplification. DAG size of input: 693 DAG size of output: 601 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 05:16:10,469 INFO L349 Elim1Store]: treesize reduction 95, result has 29.6 percent of original size [2025-02-06 05:16:10,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 31504 treesize of output 31297 [2025-02-06 05:16:11,098 INFO L349 Elim1Store]: treesize reduction 40, result has 50.0 percent of original size [2025-02-06 05:16:11,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 32263 treesize of output 32122 [2025-02-06 05:16:12,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:16:12,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 14 new quantified variables, introduced 55 case distinctions, treesize of input 33037 treesize of output 33435