./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.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_pop_back_harness.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 4c102a8320469121bebf24ca3406288a96f198533855b78a0cc2eda1e300f8b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 05:16:29,494 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 05:16:29,567 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:16:29,575 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 05:16:29,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 05:16:29,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 05:16:29,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 05:16:29,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 05:16:29,604 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 05:16:29,604 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 05:16:29,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 05:16:29,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 05:16:29,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 05:16:29,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 05:16:29,605 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 05:16:29,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 05:16:29,606 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 05:16:29,606 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 05:16:29,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 05:16:29,606 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 05:16:29,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 05:16:29,606 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 05:16:29,607 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 05:16:29,607 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 05:16:29,607 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 05:16:29,607 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 05:16:29,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 05:16:29,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 05:16:29,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 05:16:29,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:16:29,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 05:16:29,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 05:16:29,608 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 05:16:29,608 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 05:16:29,608 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 05:16:29,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 05:16:29,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 05:16:29,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 05:16:29,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 05:16:29,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 05:16:29,609 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 -> 4c102a8320469121bebf24ca3406288a96f198533855b78a0cc2eda1e300f8b5 [2025-02-06 05:16:29,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 05:16:29,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 05:16:29,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 05:16:29,902 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 05:16:29,902 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 05:16:29,904 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_pop_back_harness.i [2025-02-06 05:16:31,241 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/755a61afa/9e60f47af4314d0f8985126f3e4c1c65/FLAGabaae2d7c [2025-02-06 05:16:31,717 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 05:16:31,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i [2025-02-06 05:16:31,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/755a61afa/9e60f47af4314d0f8985126f3e4c1c65/FLAGabaae2d7c [2025-02-06 05:16:31,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/755a61afa/9e60f47af4314d0f8985126f3e4c1c65 [2025-02-06 05:16:31,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 05:16:31,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 05:16:31,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 05:16:31,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 05:16:31,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 05:16:31,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:16:31" (1/1) ... [2025-02-06 05:16:31,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ffa20e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:31, skipping insertion in model container [2025-02-06 05:16:31,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:16:31" (1/1) ... [2025-02-06 05:16:31,843 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 05:16:32,072 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_pop_back_harness.i[4498,4511] [2025-02-06 05:16:32,080 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_pop_back_harness.i[4558,4571] [2025-02-06 05:16:32,734 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:32,737 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:32,737 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:32,738 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:32,738 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:32,751 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:32,752 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:32,753 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:32,754 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:32,755 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:32,756 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:32,756 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:32,757 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:33,109 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_pop_back_harness.i[150656,150669] [2025-02-06 05:16:33,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:16:33,130 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 05:16:33,148 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_pop_back_harness.i[4498,4511] [2025-02-06 05:16:33,149 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_pop_back_harness.i[4558,4571] [2025-02-06 05:16:33,208 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:33,211 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:33,212 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:33,213 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:33,214 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:33,223 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:33,225 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:33,226 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:33,226 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:33,227 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:33,228 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:33,229 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:33,229 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:33,331 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_pop_back_harness.i[150656,150669] [2025-02-06 05:16:33,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:16:33,497 INFO L204 MainTranslator]: Completed translation [2025-02-06 05:16:33,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:33 WrapperNode [2025-02-06 05:16:33,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 05:16:33,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 05:16:33,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 05:16:33,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 05:16:33,504 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:16:33" (1/1) ... [2025-02-06 05:16:33,571 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:16:33" (1/1) ... [2025-02-06 05:16:33,612 INFO L138 Inliner]: procedures = 668, calls = 1044, calls flagged for inlining = 53, calls inlined = 8, statements flattened = 219 [2025-02-06 05:16:33,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 05:16:33,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 05:16:33,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 05:16:33,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 05:16:33,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:33" (1/1) ... [2025-02-06 05:16:33,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:33" (1/1) ... [2025-02-06 05:16:33,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:33" (1/1) ... [2025-02-06 05:16:33,672 INFO L175 MemorySlicer]: Split 43 memory accesses to 3 slices as follows [2, 36, 5]. 84 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 9 writes are split as follows [0, 9, 0]. [2025-02-06 05:16:33,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:33" (1/1) ... [2025-02-06 05:16:33,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:33" (1/1) ... [2025-02-06 05:16:33,698 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:33" (1/1) ... [2025-02-06 05:16:33,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:33" (1/1) ... [2025-02-06 05:16:33,703 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:33" (1/1) ... [2025-02-06 05:16:33,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:33" (1/1) ... [2025-02-06 05:16:33,720 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 05:16:33,722 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 05:16:33,722 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 05:16:33,722 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 05:16:33,723 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:33" (1/1) ... [2025-02-06 05:16:33,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:16:33,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:16:33,758 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:16:33,760 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:16:33,783 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2025-02-06 05:16:33,784 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2025-02-06 05:16:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2025-02-06 05:16:33,784 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2025-02-06 05:16:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 05:16:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 05:16:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 05:16:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 05:16:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 05:16:33,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 05:16:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-02-06 05:16:33,784 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-02-06 05:16:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 05:16:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-02-06 05:16:33,784 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-02-06 05:16:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 05:16:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 05:16:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 05:16:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 05:16:33,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 05:16:33,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 05:16:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2025-02-06 05:16:33,785 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2025-02-06 05:16:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 05:16:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 05:16:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 05:16:33,785 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 05:16:33,785 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 05:16:33,785 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 05:16:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 05:16:33,785 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 05:16:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 05:16:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 05:16:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 05:16:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 05:16:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 05:16:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 05:16:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 05:16:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-02-06 05:16:33,785 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-02-06 05:16:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-02-06 05:16:33,785 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-02-06 05:16:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 05:16:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 05:16:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 05:16:34,007 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 05:16:34,009 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 05:16:34,061 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4729: havoc #t~mem317.base, #t~mem317.offset;havoc #t~short318;havoc #t~mem319.base, #t~mem319.offset;havoc #t~mem320.base, #t~mem320.offset;havoc #t~short321; [2025-02-06 05:16:34,108 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-02-06 05:16:34,156 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:16:34,374 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-02-06 05:16:34,380 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4685: havoc #t~mem302.base, #t~mem302.offset; [2025-02-06 05:16:34,439 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-02-06 05:16:34,439 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 05:16:34,451 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 05:16:34,453 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 05:16:34,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:16:34 BoogieIcfgContainer [2025-02-06 05:16:34,453 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 05:16:34,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 05:16:34,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 05:16:34,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 05:16:34,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:16:31" (1/3) ... [2025-02-06 05:16:34,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bea543d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:16:34, skipping insertion in model container [2025-02-06 05:16:34,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:33" (2/3) ... [2025-02-06 05:16:34,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bea543d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:16:34, skipping insertion in model container [2025-02-06 05:16:34,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:16:34" (3/3) ... [2025-02-06 05:16:34,463 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_pop_back_harness.i [2025-02-06 05:16:34,479 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 05:16:34,481 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_pop_back_harness.i that has 13 procedures, 143 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-02-06 05:16:34,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 05:16:34,553 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;@74fc9a33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 05:16:34,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 05:16:34,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 135 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 88 states have internal predecessors, (111), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-06 05:16:34,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 05:16:34,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:16:34,572 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:16:34,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:16:34,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:16:34,578 INFO L85 PathProgramCache]: Analyzing trace with hash -670247900, now seen corresponding path program 1 times [2025-02-06 05:16:34,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:16:34,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091106735] [2025-02-06 05:16:34,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:34,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:16:34,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 05:16:34,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 05:16:34,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:34,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-02-06 05:16:35,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:16:35,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091106735] [2025-02-06 05:16:35,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091106735] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:16:35,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913043400] [2025-02-06 05:16:35,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:35,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:35,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:16:35,038 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:16:35,040 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:16:35,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 05:16:35,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 05:16:35,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:35,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:35,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 05:16:35,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:16:35,290 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-02-06 05:16:35,293 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:16:35,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913043400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:16:35,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:16:35,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 05:16:35,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789234526] [2025-02-06 05:16:35,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:16:35,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 05:16:35,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:16:35,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 05:16:35,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 05:16:35,321 INFO L87 Difference]: Start difference. First operand has 135 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 88 states have internal predecessors, (111), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 05:16:35,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:16:35,368 INFO L93 Difference]: Finished difference Result 262 states and 385 transitions. [2025-02-06 05:16:35,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 05:16:35,370 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2025-02-06 05:16:35,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:16:35,377 INFO L225 Difference]: With dead ends: 262 [2025-02-06 05:16:35,378 INFO L226 Difference]: Without dead ends: 130 [2025-02-06 05:16:35,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 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:16:35,387 INFO L435 NwaCegarLoop]: 181 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, 181 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:16:35,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:16:35,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-06 05:16:35,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-02-06 05:16:35,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 83 states have internal predecessors, (103), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 05:16:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 176 transitions. [2025-02-06 05:16:35,436 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 176 transitions. Word has length 118 [2025-02-06 05:16:35,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:16:35,436 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 176 transitions. [2025-02-06 05:16:35,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 05:16:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 176 transitions. [2025-02-06 05:16:35,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 05:16:35,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:16:35,438 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:16:35,446 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:16:35,639 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:16:35,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:16:35,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:16:35,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1007758325, now seen corresponding path program 1 times [2025-02-06 05:16:35,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:16:35,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034242901] [2025-02-06 05:16:35,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:35,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:16:35,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 05:16:35,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 05:16:35,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:35,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:36,523 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2025-02-06 05:16:36,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:16:36,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034242901] [2025-02-06 05:16:36,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034242901] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:16:36,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560127440] [2025-02-06 05:16:36,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:36,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:36,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:16:36,529 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:16:36,530 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:16:36,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 05:16:36,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 05:16:36,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:36,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:36,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-02-06 05:16:36,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:16:37,006 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 14 treesize of output 15 [2025-02-06 05:16:37,017 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:16:37,880 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-02-06 05:16:37,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 05:16:37,890 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 05:16:37,890 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 15 treesize of output 7 [2025-02-06 05:16:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 109 proven. 12 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-06 05:16:37,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:16:38,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2025-02-06 05:16:38,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:16:38,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:16:38,610 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2025-02-06 05:16:38,621 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 05:16:38,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2025-02-06 05:16:38,628 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:16:38,636 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:16:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2025-02-06 05:16:38,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560127440] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:16:38,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:16:38,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 13] total 26 [2025-02-06 05:16:38,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208820816] [2025-02-06 05:16:38,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:16:38,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 05:16:38,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:16:38,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 05:16:38,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2025-02-06 05:16:38,720 INFO L87 Difference]: Start difference. First operand 130 states and 176 transitions. Second operand has 26 states, 21 states have (on average 4.190476190476191) internal successors, (88), 22 states have internal predecessors, (88), 14 states have call successors, (43), 4 states have call predecessors, (43), 8 states have return successors, (41), 12 states have call predecessors, (41), 14 states have call successors, (41) [2025-02-06 05:16:39,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:16:39,903 INFO L93 Difference]: Finished difference Result 263 states and 358 transitions. [2025-02-06 05:16:39,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 05:16:39,904 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 4.190476190476191) internal successors, (88), 22 states have internal predecessors, (88), 14 states have call successors, (43), 4 states have call predecessors, (43), 8 states have return successors, (41), 12 states have call predecessors, (41), 14 states have call successors, (41) Word has length 118 [2025-02-06 05:16:39,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:16:39,909 INFO L225 Difference]: With dead ends: 263 [2025-02-06 05:16:39,910 INFO L226 Difference]: Without dead ends: 133 [2025-02-06 05:16:39,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 213 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=174, Invalid=1548, Unknown=0, NotChecked=0, Total=1722 [2025-02-06 05:16:39,913 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 172 mSDsluCounter, 2166 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 05:16:39,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 2323 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 05:16:39,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-06 05:16:39,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-02-06 05:16:39,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 84 states have (on average 1.25) internal successors, (105), 86 states have internal predecessors, (105), 37 states have call successors, (37), 10 states have call predecessors, (37), 11 states have return successors, (40), 36 states have call predecessors, (40), 36 states have call successors, (40) [2025-02-06 05:16:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 182 transitions. [2025-02-06 05:16:39,928 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 182 transitions. Word has length 118 [2025-02-06 05:16:39,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:16:39,929 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 182 transitions. [2025-02-06 05:16:39,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 4.190476190476191) internal successors, (88), 22 states have internal predecessors, (88), 14 states have call successors, (43), 4 states have call predecessors, (43), 8 states have return successors, (41), 12 states have call predecessors, (41), 14 states have call successors, (41) [2025-02-06 05:16:39,929 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 182 transitions. [2025-02-06 05:16:39,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 05:16:39,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:16:39,931 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 1] [2025-02-06 05:16:39,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 05:16:40,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:40,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:16:40,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:16:40,132 INFO L85 PathProgramCache]: Analyzing trace with hash -400384383, now seen corresponding path program 1 times [2025-02-06 05:16:40,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:16:40,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769294319] [2025-02-06 05:16:40,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:40,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:16:40,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 05:16:40,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 05:16:40,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:40,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-02-06 05:16:40,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:16:40,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769294319] [2025-02-06 05:16:40,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769294319] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:16:40,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976346795] [2025-02-06 05:16:40,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:40,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:40,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:16:40,520 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:16:40,522 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:16:40,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 05:16:40,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 05:16:40,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:40,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:40,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 05:16:40,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:16:40,855 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-02-06 05:16:40,856 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:16:40,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976346795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:16:40,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:16:40,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2025-02-06 05:16:40,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012701137] [2025-02-06 05:16:40,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:16:40,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 05:16:40,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:16:40,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 05:16:40,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-02-06 05:16:40,861 INFO L87 Difference]: Start difference. First operand 133 states and 182 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-06 05:16:41,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:16:41,169 INFO L93 Difference]: Finished difference Result 252 states and 346 transitions. [2025-02-06 05:16:41,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 05:16:41,170 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 120 [2025-02-06 05:16:41,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:16:41,172 INFO L225 Difference]: With dead ends: 252 [2025-02-06 05:16:41,172 INFO L226 Difference]: Without dead ends: 135 [2025-02-06 05:16:41,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2025-02-06 05:16:41,173 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 203 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 05:16:41,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 887 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 05:16:41,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-06 05:16:41,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2025-02-06 05:16:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 84 states have (on average 1.2380952380952381) internal successors, (104), 86 states have internal predecessors, (104), 37 states have call successors, (37), 10 states have call predecessors, (37), 11 states have return successors, (40), 36 states have call predecessors, (40), 36 states have call successors, (40) [2025-02-06 05:16:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 181 transitions. [2025-02-06 05:16:41,191 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 181 transitions. Word has length 120 [2025-02-06 05:16:41,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:16:41,191 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 181 transitions. [2025-02-06 05:16:41,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-06 05:16:41,192 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 181 transitions. [2025-02-06 05:16:41,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 05:16:41,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:16:41,193 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2025-02-06 05:16:41,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 05:16:41,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:41,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:16:41,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:16:41,394 INFO L85 PathProgramCache]: Analyzing trace with hash -386050215, now seen corresponding path program 1 times [2025-02-06 05:16:41,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:16:41,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332296738] [2025-02-06 05:16:41,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:41,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:16:41,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 05:16:41,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 05:16:41,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:41,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-02-06 05:16:41,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:16:41,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332296738] [2025-02-06 05:16:41,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332296738] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:16:41,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681592440] [2025-02-06 05:16:41,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:41,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:41,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:16:41,786 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:16:41,788 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:16:41,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 05:16:41,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 05:16:41,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:41,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:41,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 05:16:41,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:16:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-02-06 05:16:42,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:16:42,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681592440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:16:42,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:16:42,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2025-02-06 05:16:42,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585208958] [2025-02-06 05:16:42,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:16:42,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 05:16:42,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:16:42,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 05:16:42,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-02-06 05:16:42,134 INFO L87 Difference]: Start difference. First operand 133 states and 181 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-06 05:16:42,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:16:42,515 INFO L93 Difference]: Finished difference Result 258 states and 354 transitions. [2025-02-06 05:16:42,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 05:16:42,515 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 122 [2025-02-06 05:16:42,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:16:42,519 INFO L225 Difference]: With dead ends: 258 [2025-02-06 05:16:42,519 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 05:16:42,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2025-02-06 05:16:42,522 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 217 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 05:16:42,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 998 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 05:16:42,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 05:16:42,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2025-02-06 05:16:42,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 87 states have internal predecessors, (105), 37 states have call successors, (37), 10 states have call predecessors, (37), 11 states have return successors, (40), 36 states have call predecessors, (40), 36 states have call successors, (40) [2025-02-06 05:16:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 182 transitions. [2025-02-06 05:16:42,543 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 182 transitions. Word has length 122 [2025-02-06 05:16:42,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:16:42,545 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 182 transitions. [2025-02-06 05:16:42,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-06 05:16:42,545 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 182 transitions. [2025-02-06 05:16:42,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 05:16:42,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:16:42,550 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:16:42,560 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:16:42,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:42,751 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:16:42,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:16:42,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1732901271, now seen corresponding path program 1 times [2025-02-06 05:16:42,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:16:42,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911132969] [2025-02-06 05:16:42,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:42,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:16:42,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 05:16:42,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 05:16:42,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:42,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-02-06 05:16:43,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:16:43,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911132969] [2025-02-06 05:16:43,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911132969] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:16:43,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155192394] [2025-02-06 05:16:43,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:43,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:43,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:16:43,171 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:16:43,173 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:16:43,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 05:16:43,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 05:16:43,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:43,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:43,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 05:16:43,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:16:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-02-06 05:16:43,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:16:43,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155192394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:16:43,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:16:43,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-02-06 05:16:43,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271784515] [2025-02-06 05:16:43,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:16:43,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 05:16:43,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:16:43,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 05:16:43,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 05:16:43,417 INFO L87 Difference]: Start difference. First operand 134 states and 182 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 05:16:43,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:16:43,442 INFO L93 Difference]: Finished difference Result 253 states and 349 transitions. [2025-02-06 05:16:43,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 05:16:43,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 123 [2025-02-06 05:16:43,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:16:43,444 INFO L225 Difference]: With dead ends: 253 [2025-02-06 05:16:43,444 INFO L226 Difference]: Without dead ends: 138 [2025-02-06 05:16:43,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 05:16:43,445 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 2 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:16:43,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 339 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:16:43,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-06 05:16:43,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2025-02-06 05:16:43,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 88 states have internal predecessors, (106), 37 states have call successors, (37), 10 states have call predecessors, (37), 11 states have return successors, (40), 36 states have call predecessors, (40), 36 states have call successors, (40) [2025-02-06 05:16:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 183 transitions. [2025-02-06 05:16:43,469 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 183 transitions. Word has length 123 [2025-02-06 05:16:43,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:16:43,469 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 183 transitions. [2025-02-06 05:16:43,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 05:16:43,470 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 183 transitions. [2025-02-06 05:16:43,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 05:16:43,472 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:16:43,472 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:16:43,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 05:16:43,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:43,673 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:16:43,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:16:43,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1158313288, now seen corresponding path program 1 times [2025-02-06 05:16:43,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:16:43,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015747153] [2025-02-06 05:16:43,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:43,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:16:43,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 05:16:43,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 05:16:43,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:43,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:44,111 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-02-06 05:16:44,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:16:44,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015747153] [2025-02-06 05:16:44,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015747153] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:16:44,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292589499] [2025-02-06 05:16:44,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:44,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:44,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:16:44,115 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:16:44,117 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:16:44,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 05:16:44,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 05:16:44,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:44,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:44,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 05:16:44,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:16:44,507 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-02-06 05:16:44,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:16:44,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292589499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:16:44,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:16:44,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 13 [2025-02-06 05:16:44,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521065826] [2025-02-06 05:16:44,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:16:44,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 05:16:44,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:16:44,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 05:16:44,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-06 05:16:44,510 INFO L87 Difference]: Start difference. First operand 135 states and 183 transitions. Second operand has 11 states, 9 states have (on average 7.444444444444445) internal successors, (67), 10 states have internal predecessors, (67), 6 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2025-02-06 05:16:44,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:16:44,913 INFO L93 Difference]: Finished difference Result 251 states and 341 transitions. [2025-02-06 05:16:44,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 05:16:44,913 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.444444444444445) internal successors, (67), 10 states have internal predecessors, (67), 6 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Word has length 131 [2025-02-06 05:16:44,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:16:44,915 INFO L225 Difference]: With dead ends: 251 [2025-02-06 05:16:44,915 INFO L226 Difference]: Without dead ends: 138 [2025-02-06 05:16:44,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-02-06 05:16:44,916 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 176 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 05:16:44,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1044 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 05:16:44,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-06 05:16:44,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2025-02-06 05:16:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 87 states have (on average 1.2298850574712643) internal successors, (107), 89 states have internal predecessors, (107), 37 states have call successors, (37), 10 states have call predecessors, (37), 11 states have return successors, (40), 36 states have call predecessors, (40), 36 states have call successors, (40) [2025-02-06 05:16:44,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 184 transitions. [2025-02-06 05:16:44,939 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 184 transitions. Word has length 131 [2025-02-06 05:16:44,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:16:44,939 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 184 transitions. [2025-02-06 05:16:44,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.444444444444445) internal successors, (67), 10 states have internal predecessors, (67), 6 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2025-02-06 05:16:44,940 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 184 transitions. [2025-02-06 05:16:44,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 05:16:44,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:16:44,942 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:16:44,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 05:16:45,147 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,SelfDestructingSolverStorable5 [2025-02-06 05:16:45,147 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:16:45,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:16:45,147 INFO L85 PathProgramCache]: Analyzing trace with hash -2012768558, now seen corresponding path program 1 times [2025-02-06 05:16:45,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:16:45,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126687847] [2025-02-06 05:16:45,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:45,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:16:45,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 05:16:45,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 05:16:45,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:45,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:45,977 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-02-06 05:16:45,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:16:45,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126687847] [2025-02-06 05:16:45,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126687847] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:16:45,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172362206] [2025-02-06 05:16:45,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:45,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:45,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:16:45,980 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:16:45,982 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:16:46,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 05:16:46,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 05:16:46,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:46,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:46,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-02-06 05:16:46,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:16:46,295 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:16:46,297 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:16:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 113 proven. 1 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-02-06 05:16:46,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:16:47,004 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 05:16:47,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172362206] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:16:47,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:16:47,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 8] total 28 [2025-02-06 05:16:47,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503544494] [2025-02-06 05:16:47,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:16:47,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 05:16:47,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:16:47,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 05:16:47,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2025-02-06 05:16:47,008 INFO L87 Difference]: Start difference. First operand 136 states and 184 transitions. Second operand has 28 states, 26 states have (on average 4.384615384615385) internal successors, (114), 25 states have internal predecessors, (114), 9 states have call successors, (33), 2 states have call predecessors, (33), 5 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2025-02-06 05:16:48,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:16:48,709 INFO L93 Difference]: Finished difference Result 347 states and 516 transitions. [2025-02-06 05:16:48,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-06 05:16:48,709 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 4.384615384615385) internal successors, (114), 25 states have internal predecessors, (114), 9 states have call successors, (33), 2 states have call predecessors, (33), 5 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) Word has length 133 [2025-02-06 05:16:48,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:16:48,712 INFO L225 Difference]: With dead ends: 347 [2025-02-06 05:16:48,712 INFO L226 Difference]: Without dead ends: 230 [2025-02-06 05:16:48,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=238, Invalid=2312, Unknown=0, NotChecked=0, Total=2550 [2025-02-06 05:16:48,715 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 234 mSDsluCounter, 2588 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 2751 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:16:48,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 2751 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 05:16:48,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-06 05:16:48,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 183. [2025-02-06 05:16:48,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 122 states have (on average 1.2459016393442623) internal successors, (152), 126 states have internal predecessors, (152), 45 states have call successors, (45), 12 states have call predecessors, (45), 15 states have return successors, (63), 44 states have call predecessors, (63), 44 states have call successors, (63) [2025-02-06 05:16:48,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 260 transitions. [2025-02-06 05:16:48,739 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 260 transitions. Word has length 133 [2025-02-06 05:16:48,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:16:48,739 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 260 transitions. [2025-02-06 05:16:48,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 4.384615384615385) internal successors, (114), 25 states have internal predecessors, (114), 9 states have call successors, (33), 2 states have call predecessors, (33), 5 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2025-02-06 05:16:48,739 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 260 transitions. [2025-02-06 05:16:48,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 05:16:48,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:16:48,741 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:16:48,751 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:16:48,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:48,943 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:16:48,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:16:48,943 INFO L85 PathProgramCache]: Analyzing trace with hash -62327181, now seen corresponding path program 1 times [2025-02-06 05:16:48,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:16:48,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795683142] [2025-02-06 05:16:48,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:48,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:16:48,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 05:16:48,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 05:16:48,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:48,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:49,052 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 05:16:49,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:16:49,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795683142] [2025-02-06 05:16:49,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795683142] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:16:49,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779214564] [2025-02-06 05:16:49,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:49,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:49,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:16:49,056 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:16:49,058 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:16:49,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 05:16:49,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 05:16:49,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:49,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:49,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 05:16:49,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:16:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-02-06 05:16:49,294 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:16:49,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779214564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:16:49,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:16:49,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-02-06 05:16:49,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440602647] [2025-02-06 05:16:49,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:16:49,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:16:49,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:16:49,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:16:49,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:16:49,296 INFO L87 Difference]: Start difference. First operand 183 states and 260 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 05:16:49,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:16:49,332 INFO L93 Difference]: Finished difference Result 350 states and 516 transitions. [2025-02-06 05:16:49,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:16:49,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2025-02-06 05:16:49,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:16:49,336 INFO L225 Difference]: With dead ends: 350 [2025-02-06 05:16:49,337 INFO L226 Difference]: Without dead ends: 186 [2025-02-06 05:16:49,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:16:49,339 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:16:49,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 513 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:16:49,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-06 05:16:49,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2025-02-06 05:16:49,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 124 states have (on average 1.2338709677419355) internal successors, (153), 128 states have internal predecessors, (153), 45 states have call successors, (45), 12 states have call predecessors, (45), 15 states have return successors, (63), 44 states have call predecessors, (63), 44 states have call successors, (63) [2025-02-06 05:16:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 261 transitions. [2025-02-06 05:16:49,360 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 261 transitions. Word has length 133 [2025-02-06 05:16:49,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:16:49,360 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 261 transitions. [2025-02-06 05:16:49,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 05:16:49,360 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 261 transitions. [2025-02-06 05:16:49,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 05:16:49,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:16:49,362 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:16:49,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 05:16:49,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:49,566 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:16:49,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:16:49,567 INFO L85 PathProgramCache]: Analyzing trace with hash 158704659, now seen corresponding path program 1 times [2025-02-06 05:16:49,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:16:49,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089904525] [2025-02-06 05:16:49,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:49,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:16:49,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 05:16:49,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 05:16:49,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:49,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:49,664 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-02-06 05:16:49,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:16:49,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089904525] [2025-02-06 05:16:49,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089904525] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:16:49,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163083227] [2025-02-06 05:16:49,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:49,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:49,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:16:49,667 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:16:49,669 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:16:49,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 05:16:49,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 05:16:49,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:49,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:49,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 05:16:49,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:16:49,932 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-02-06 05:16:49,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:16:49,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163083227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:16:49,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:16:49,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-02-06 05:16:49,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383496607] [2025-02-06 05:16:49,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:16:49,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:16:49,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:16:49,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:16:49,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:16:49,934 INFO L87 Difference]: Start difference. First operand 185 states and 261 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 05:16:49,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:16:49,958 INFO L93 Difference]: Finished difference Result 337 states and 484 transitions. [2025-02-06 05:16:49,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:16:49,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2025-02-06 05:16:49,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:16:49,960 INFO L225 Difference]: With dead ends: 337 [2025-02-06 05:16:49,960 INFO L226 Difference]: Without dead ends: 171 [2025-02-06 05:16:49,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:16:49,962 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:16:49,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:16:49,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-06 05:16:49,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-02-06 05:16:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 116 states have (on average 1.2155172413793103) internal successors, (141), 119 states have internal predecessors, (141), 40 states have call successors, (40), 12 states have call predecessors, (40), 14 states have return successors, (50), 39 states have call predecessors, (50), 39 states have call successors, (50) [2025-02-06 05:16:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 231 transitions. [2025-02-06 05:16:49,974 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 231 transitions. Word has length 133 [2025-02-06 05:16:49,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:16:49,975 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 231 transitions. [2025-02-06 05:16:49,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 05:16:49,975 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 231 transitions. [2025-02-06 05:16:49,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 05:16:49,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:16:49,976 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:16:49,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 05:16:50,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:50,177 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:16:50,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:16:50,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1450727106, now seen corresponding path program 1 times [2025-02-06 05:16:50,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:16:50,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309343839] [2025-02-06 05:16:50,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:50,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:16:50,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 05:16:50,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 05:16:50,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:50,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-06 05:16:50,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:16:50,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309343839] [2025-02-06 05:16:50,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309343839] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:16:50,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768772142] [2025-02-06 05:16:50,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:50,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:50,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:16:50,498 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:16:50,501 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:16:50,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 05:16:50,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 05:16:50,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:50,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:50,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-02-06 05:16:50,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:16:50,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:16:50,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 24 treesize of output 32 [2025-02-06 05:16:50,913 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 12 treesize of output 11 [2025-02-06 05:16:50,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:16:50,935 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 21 treesize of output 1 [2025-02-06 05:16:50,988 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (let ((.cse0 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) .cse0) 24 .cse1) .cse2) (<= 2 .cse0) (<= (+ 2 .cse1) .cse0)))))) is different from true [2025-02-06 05:16:51,165 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_12| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_12|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_3) .cse1 v_DerPreprocessor_4) .cse0) 24 .cse1) .cse2) (<= (+ 2 .cse1) .cse0) (<= 2 .cse0)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (let ((.cse3 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select .cse5 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) .cse3) 24 .cse4) .cse5) (<= 2 .cse3) (<= (+ 2 .cse4) .cse3))))))) is different from true [2025-02-06 05:16:51,405 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_12| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_12|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_3) .cse1 v_DerPreprocessor_4) .cse0) 24 .cse1) .cse2) (<= (+ 2 .cse1) .cse0) (<= 2 .cse0)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (let ((.cse3 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select .cse5 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) .cse3) 24 .cse4) .cse5) (<= 2 .cse3) (<= (+ 2 .cse4) .cse3)))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse7 (select v_DerPreprocessor_6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13|))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse7))) (let ((.cse8 (select .cse6 24))) (and (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_5) .cse8 v_DerPreprocessor_6) .cse7) 24 .cse8)) (<= 2 .cse7) (<= (+ .cse8 2) .cse7))))))) is different from true [2025-02-06 05:16:51,711 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_12| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_12|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_3) .cse1 v_DerPreprocessor_4) .cse0) 24 .cse1) .cse2) (<= (+ 2 .cse1) .cse0) (<= 2 .cse0)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (let ((.cse3 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select .cse5 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) .cse3) 24 .cse4) .cse5) (<= 2 .cse3) (<= (+ 2 .cse4) .cse3)))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_14| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse7 (select v_DerPreprocessor_8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_14|))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse7))) (let ((.cse8 (select .cse6 24))) (and (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_7) .cse8 v_DerPreprocessor_8) .cse7) 24 .cse8)) (<= (+ .cse8 2) .cse7) (<= 2 .cse7)))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse10 (select v_DerPreprocessor_6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse10))) (let ((.cse11 (select .cse9 24))) (and (= .cse9 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_5) .cse11 v_DerPreprocessor_6) .cse10) 24 .cse11)) (<= 2 .cse10) (<= (+ .cse11 2) .cse10))))))) is different from true [2025-02-06 05:16:52,015 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_12| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_12|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_3) .cse1 v_DerPreprocessor_4) .cse0) 24 .cse1) .cse2) (<= (+ 2 .cse1) .cse0) (<= 2 .cse0)))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_15| Int)) (let ((.cse4 (select v_DerPreprocessor_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_15|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse3 (select .cse5 24))) (and (<= (+ .cse3 2) .cse4) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_9) .cse3 v_DerPreprocessor_10) .cse4) 24 .cse3)) (<= 2 .cse4)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (let ((.cse6 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse7 (select .cse8 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) .cse6) 24 .cse7) .cse8) (<= 2 .cse6) (<= (+ 2 .cse7) .cse6)))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_14| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse10 (select v_DerPreprocessor_8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_14|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse10))) (let ((.cse11 (select .cse9 24))) (and (= .cse9 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_7) .cse11 v_DerPreprocessor_8) .cse10) 24 .cse11)) (<= (+ .cse11 2) .cse10) (<= 2 .cse10)))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse13 (select v_DerPreprocessor_6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13|))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse13))) (let ((.cse14 (select .cse12 24))) (and (= .cse12 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse13 v_DerPreprocessor_5) .cse14 v_DerPreprocessor_6) .cse13) 24 .cse14)) (<= 2 .cse13) (<= (+ .cse14 2) .cse13))))))) is different from true [2025-02-06 05:16:52,585 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_12| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_12|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_3) .cse1 v_DerPreprocessor_4) .cse0) 24 .cse1) .cse2) (<= (+ 2 .cse1) .cse0) (<= 2 .cse0)))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_15| Int)) (let ((.cse4 (select v_DerPreprocessor_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_15|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse3 (select .cse5 24))) (and (<= (+ .cse3 2) .cse4) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_9) .cse3 v_DerPreprocessor_10) .cse4) 24 .cse3)) (<= 2 .cse4)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (let ((.cse6 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse7 (select .cse8 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) .cse6) 24 .cse7) .cse8) (<= 2 .cse6) (<= (+ 2 .cse7) .cse6)))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_14| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse10 (select v_DerPreprocessor_8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_14|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse10))) (let ((.cse11 (select .cse9 24))) (and (= .cse9 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_7) .cse11 v_DerPreprocessor_8) .cse10) 24 .cse11)) (<= (+ .cse11 2) .cse10) (<= 2 .cse10)))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse13 (select v_DerPreprocessor_6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13|))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse13))) (let ((.cse14 (select .cse12 24))) (and (= .cse12 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse13 v_DerPreprocessor_5) .cse14 v_DerPreprocessor_6) .cse13) 24 .cse14)) (<= 2 .cse13) (<= (+ .cse14 2) .cse13)))))) (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16| Int)) (let ((.cse15 (select v_DerPreprocessor_12 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16|))) (let ((.cse16 (select |c_#memory_$Pointer$#1.base| .cse15))) (let ((.cse17 (select .cse16 24))) (and (<= 2 .cse15) (= .cse16 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse15 v_DerPreprocessor_11) .cse17 v_DerPreprocessor_12) .cse15) 24 .cse17)) (<= (+ 2 .cse17) .cse15))))))) is different from true [2025-02-06 05:16:53,088 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17| Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (<= 2 .cse0) (<= (+ 2 .cse1) .cse0) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_13) .cse1 v_DerPreprocessor_14) .cse0) 24 .cse1))))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_12| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse3 (select v_DerPreprocessor_4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_12|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select .cse5 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_3) .cse4 v_DerPreprocessor_4) .cse3) 24 .cse4) .cse5) (<= (+ 2 .cse4) .cse3) (<= 2 .cse3)))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_15| Int)) (let ((.cse7 (select v_DerPreprocessor_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_15|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse7))) (let ((.cse6 (select .cse8 24))) (and (<= (+ .cse6 2) .cse7) (= .cse8 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_9) .cse6 v_DerPreprocessor_10) .cse7) 24 .cse6)) (<= 2 .cse7)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (let ((.cse9 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse9))) (let ((.cse10 (select .cse11 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse9 v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) .cse9) 24 .cse10) .cse11) (<= 2 .cse9) (<= (+ 2 .cse10) .cse9)))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_14| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse13 (select v_DerPreprocessor_8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_14|))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse13))) (let ((.cse14 (select .cse12 24))) (and (= .cse12 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse13 v_DerPreprocessor_7) .cse14 v_DerPreprocessor_8) .cse13) 24 .cse14)) (<= (+ .cse14 2) .cse13) (<= 2 .cse13)))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse16 (select v_DerPreprocessor_6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13|))) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| .cse16))) (let ((.cse17 (select .cse15 24))) (and (= .cse15 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse16 v_DerPreprocessor_5) .cse17 v_DerPreprocessor_6) .cse16) 24 .cse17)) (<= 2 .cse16) (<= (+ .cse17 2) .cse16)))))) (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16| Int)) (let ((.cse18 (select v_DerPreprocessor_12 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16|))) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| .cse18))) (let ((.cse20 (select .cse19 24))) (and (<= 2 .cse18) (= .cse19 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse18 v_DerPreprocessor_11) .cse20 v_DerPreprocessor_12) .cse18) 24 .cse20)) (<= (+ 2 .cse20) .cse18))))))) is different from true [2025-02-06 05:16:55,968 INFO L349 Elim1Store]: treesize reduction 416, result has 0.2 percent of original size [2025-02-06 05:16:55,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 44 case distinctions, treesize of input 587 treesize of output 1 [2025-02-06 05:16:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 76 not checked. [2025-02-06 05:16:55,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:16:57,709 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:16:57,842 INFO L349 Elim1Store]: treesize reduction 153, result has 52.3 percent of original size [2025-02-06 05:16:57,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 2204 treesize of output 1636 [2025-02-06 05:16:57,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1927 treesize of output 1855 [2025-02-06 05:16:58,054 INFO L349 Elim1Store]: treesize reduction 26, result has 80.2 percent of original size [2025-02-06 05:16:58,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 1017 treesize of output 1010 [2025-02-06 05:16:58,117 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 662 treesize of output 626 [2025-02-06 05:16:58,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:16:58,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 683 treesize of output 697 [2025-02-06 05:16:58,316 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 569 treesize of output 547 [2025-02-06 05:16:58,427 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-06 05:16:59,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:16:59,738 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 23 treesize of output 27 [2025-02-06 05:16:59,785 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:16:59,990 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:17:00,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:00,153 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 18 treesize of output 22 [2025-02-06 05:17:00,324 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:17:00,340 INFO L349 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2025-02-06 05:17:00,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 95 [2025-02-06 05:17:00,405 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:17:00,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2025-02-06 05:17:00,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:00,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 205 treesize of output 239 [2025-02-06 05:17:01,267 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-02-06 05:17:01,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768772142] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:17:01,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:17:01,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 29, 18] total 50 [2025-02-06 05:17:01,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940228043] [2025-02-06 05:17:01,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:17:01,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-02-06 05:17:01,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:01,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-02-06 05:17:01,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1659, Unknown=24, NotChecked=616, Total=2450 [2025-02-06 05:17:01,271 INFO L87 Difference]: Start difference. First operand 171 states and 231 transitions. Second operand has 50 states, 43 states have (on average 4.093023255813954) internal successors, (176), 40 states have internal predecessors, (176), 19 states have call successors, (44), 11 states have call predecessors, (44), 15 states have return successors, (42), 17 states have call predecessors, (42), 19 states have call successors, (42) [2025-02-06 05:17:01,936 WARN L873 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (let ((.cse0 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) .cse0) 24 .cse1) .cse2) (<= 2 .cse0) (<= (+ 2 .cse1) .cse0))))))) is different from true [2025-02-06 05:17:02,003 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (let ((.cse0 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) .cse0) 24 .cse1) .cse2) (<= 2 .cse0) (<= (+ 2 .cse1) .cse0)))))) (not (= |c_assume_abort_if_not_#in~cond| 0))) is different from true [2025-02-06 05:17:02,124 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_12| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_12|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_3) .cse1 v_DerPreprocessor_4) .cse0) 24 .cse1) .cse2) (<= (+ 2 .cse1) .cse0) (<= 2 .cse0)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (let ((.cse3 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select .cse5 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) .cse3) 24 .cse4) .cse5) (<= 2 .cse3) (<= (+ 2 .cse4) .cse3)))))) (not (= |c_assume_abort_if_not_#in~cond| 0))) is different from true [2025-02-06 05:17:02,499 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_12| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_12|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_3) .cse1 v_DerPreprocessor_4) .cse0) 24 .cse1) .cse2) (<= (+ 2 .cse1) .cse0) (<= 2 .cse0)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (let ((.cse3 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select .cse5 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) .cse3) 24 .cse4) .cse5) (<= 2 .cse3) (<= (+ 2 .cse4) .cse3)))))) (not (= |c_assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse7 (select v_DerPreprocessor_6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13|))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse7))) (let ((.cse8 (select .cse6 24))) (and (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_5) .cse8 v_DerPreprocessor_6) .cse7) 24 .cse8)) (<= 2 .cse7) (<= (+ .cse8 2) .cse7))))))) is different from true [2025-02-06 05:17:02,642 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_12| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_12|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_3) .cse1 v_DerPreprocessor_4) .cse0) 24 .cse1) .cse2) (<= (+ 2 .cse1) .cse0) (<= 2 .cse0)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (let ((.cse3 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select .cse5 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) .cse3) 24 .cse4) .cse5) (<= 2 .cse3) (<= (+ 2 .cse4) .cse3)))))) (not (= |c_assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_14| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse7 (select v_DerPreprocessor_8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_14|))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse7))) (let ((.cse8 (select .cse6 24))) (and (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_7) .cse8 v_DerPreprocessor_8) .cse7) 24 .cse8)) (<= (+ .cse8 2) .cse7) (<= 2 .cse7)))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse10 (select v_DerPreprocessor_6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse10))) (let ((.cse11 (select .cse9 24))) (and (= .cse9 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_5) .cse11 v_DerPreprocessor_6) .cse10) 24 .cse11)) (<= 2 .cse10) (<= (+ .cse11 2) .cse10))))))) is different from true [2025-02-06 05:17:03,973 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_12| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_12|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_3) .cse1 v_DerPreprocessor_4) .cse0) 24 .cse1) .cse2) (<= (+ 2 .cse1) .cse0) (<= 2 .cse0)))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_15| Int)) (let ((.cse4 (select v_DerPreprocessor_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_15|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse3 (select .cse5 24))) (and (<= (+ .cse3 2) .cse4) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_9) .cse3 v_DerPreprocessor_10) .cse4) 24 .cse3)) (<= 2 .cse4)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (let ((.cse6 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse7 (select .cse8 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) .cse6) 24 .cse7) .cse8) (<= 2 .cse6) (<= (+ 2 .cse7) .cse6)))))) (not (= |c_assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_14| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse10 (select v_DerPreprocessor_8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_14|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse10))) (let ((.cse11 (select .cse9 24))) (and (= .cse9 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_7) .cse11 v_DerPreprocessor_8) .cse10) 24 .cse11)) (<= (+ .cse11 2) .cse10) (<= 2 .cse10)))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse13 (select v_DerPreprocessor_6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13|))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse13))) (let ((.cse14 (select .cse12 24))) (and (= .cse12 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse13 v_DerPreprocessor_5) .cse14 v_DerPreprocessor_6) .cse13) 24 .cse14)) (<= 2 .cse13) (<= (+ .cse14 2) .cse13)))))) (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16| Int)) (let ((.cse15 (select v_DerPreprocessor_12 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16|))) (let ((.cse16 (select |c_#memory_$Pointer$#1.base| .cse15))) (let ((.cse17 (select .cse16 24))) (and (<= 2 .cse15) (= .cse16 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse15 v_DerPreprocessor_11) .cse17 v_DerPreprocessor_12) .cse15) 24 .cse17)) (<= (+ 2 .cse17) .cse15))))))) is different from true [2025-02-06 05:17:07,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:17:07,242 INFO L93 Difference]: Finished difference Result 380 states and 499 transitions. [2025-02-06 05:17:07,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-02-06 05:17:07,242 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 43 states have (on average 4.093023255813954) internal successors, (176), 40 states have internal predecessors, (176), 19 states have call successors, (44), 11 states have call predecessors, (44), 15 states have return successors, (42), 17 states have call predecessors, (42), 19 states have call successors, (42) Word has length 134 [2025-02-06 05:17:07,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:07,244 INFO L225 Difference]: With dead ends: 380 [2025-02-06 05:17:07,244 INFO L226 Difference]: Without dead ends: 219 [2025-02-06 05:17:07,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=298, Invalid=3848, Unknown=66, NotChecked=1794, Total=6006 [2025-02-06 05:17:07,247 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 54 mSDsluCounter, 3350 mSDsCounter, 0 mSdLazyCounter, 2321 mSolverCounterSat, 35 mSolverCounterUnsat, 50 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 3499 SdHoareTripleChecker+Invalid, 5119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2321 IncrementalHoareTripleChecker+Invalid, 50 IncrementalHoareTripleChecker+Unknown, 2713 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:17:07,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 3499 Invalid, 5119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2321 Invalid, 50 Unknown, 2713 Unchecked, 4.1s Time] [2025-02-06 05:17:07,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-06 05:17:07,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 214. [2025-02-06 05:17:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 151 states have (on average 1.205298013245033) internal successors, (182), 153 states have internal predecessors, (182), 40 states have call successors, (40), 20 states have call predecessors, (40), 22 states have return successors, (52), 40 states have call predecessors, (52), 39 states have call successors, (52) [2025-02-06 05:17:07,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 274 transitions. [2025-02-06 05:17:07,270 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 274 transitions. Word has length 134 [2025-02-06 05:17:07,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:17:07,271 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 274 transitions. [2025-02-06 05:17:07,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 43 states have (on average 4.093023255813954) internal successors, (176), 40 states have internal predecessors, (176), 19 states have call successors, (44), 11 states have call predecessors, (44), 15 states have return successors, (42), 17 states have call predecessors, (42), 19 states have call successors, (42) [2025-02-06 05:17:07,271 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 274 transitions. [2025-02-06 05:17:07,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 05:17:07,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:07,273 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2025-02-06 05:17:07,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 05:17:07,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 05:17:07,474 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:07,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:07,474 INFO L85 PathProgramCache]: Analyzing trace with hash -217192912, now seen corresponding path program 1 times [2025-02-06 05:17:07,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:07,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900956596] [2025-02-06 05:17:07,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:07,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:07,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 05:17:07,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 05:17:07,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:07,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:09,648 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 05:17:09,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:09,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900956596] [2025-02-06 05:17:09,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900956596] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:09,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070021008] [2025-02-06 05:17:09,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:09,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:09,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:09,651 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:17:09,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 05:17:09,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 05:17:09,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 05:17:09,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:09,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:09,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 05:17:09,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:10,249 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-02-06 05:17:10,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:17:10,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070021008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:17:10,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:17:10,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [18] total 28 [2025-02-06 05:17:10,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981627140] [2025-02-06 05:17:10,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:17:10,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 05:17:10,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:10,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 05:17:10,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2025-02-06 05:17:10,253 INFO L87 Difference]: Start difference. First operand 214 states and 274 transitions. Second operand has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 5 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2025-02-06 05:17:10,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:17:10,654 INFO L93 Difference]: Finished difference Result 372 states and 486 transitions. [2025-02-06 05:17:10,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 05:17:10,655 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 5 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) Word has length 156 [2025-02-06 05:17:10,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:10,657 INFO L225 Difference]: With dead ends: 372 [2025-02-06 05:17:10,657 INFO L226 Difference]: Without dead ends: 216 [2025-02-06 05:17:10,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=1235, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 05:17:10,658 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 168 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 05:17:10,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1306 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 05:17:10,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-06 05:17:10,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 212. [2025-02-06 05:17:10,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 150 states have (on average 1.2066666666666668) internal successors, (181), 151 states have internal predecessors, (181), 40 states have call successors, (40), 20 states have call predecessors, (40), 21 states have return successors, (48), 40 states have call predecessors, (48), 39 states have call successors, (48) [2025-02-06 05:17:10,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 269 transitions. [2025-02-06 05:17:10,681 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 269 transitions. Word has length 156 [2025-02-06 05:17:10,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:17:10,682 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 269 transitions. [2025-02-06 05:17:10,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 5 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2025-02-06 05:17:10,682 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 269 transitions. [2025-02-06 05:17:10,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-06 05:17:10,686 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:10,686 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:17:10,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 05:17:10,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 05:17:10,887 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:10,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:10,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1342473790, now seen corresponding path program 1 times [2025-02-06 05:17:10,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:10,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388352564] [2025-02-06 05:17:10,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:10,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:10,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 05:17:10,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 05:17:10,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:10,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:11,457 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 15 proven. 36 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 05:17:11,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:11,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388352564] [2025-02-06 05:17:11,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388352564] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:11,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807050538] [2025-02-06 05:17:11,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:11,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:11,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:11,460 INFO L229 MonitoredProcess]: Starting monitored process 13 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:17:11,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 05:17:11,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 05:17:11,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 05:17:11,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:11,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:11,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 05:17:11,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-06 05:17:11,794 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:17:11,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807050538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:17:11,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:17:11,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2025-02-06 05:17:11,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028275735] [2025-02-06 05:17:11,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:17:11,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 05:17:11,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:11,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 05:17:11,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-06 05:17:11,795 INFO L87 Difference]: Start difference. First operand 212 states and 269 transitions. Second operand has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 4 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-06 05:17:11,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:17:11,904 INFO L93 Difference]: Finished difference Result 372 states and 485 transitions. [2025-02-06 05:17:11,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 05:17:11,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 4 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 169 [2025-02-06 05:17:11,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:11,907 INFO L225 Difference]: With dead ends: 372 [2025-02-06 05:17:11,907 INFO L226 Difference]: Without dead ends: 218 [2025-02-06 05:17:11,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 05:17:11,908 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:17:11,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1101 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:17:11,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-06 05:17:11,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2025-02-06 05:17:11,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 153 states have (on average 1.2026143790849673) internal successors, (184), 155 states have internal predecessors, (184), 40 states have call successors, (40), 20 states have call predecessors, (40), 22 states have return successors, (52), 40 states have call predecessors, (52), 39 states have call successors, (52) [2025-02-06 05:17:11,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 276 transitions. [2025-02-06 05:17:11,943 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 276 transitions. Word has length 169 [2025-02-06 05:17:11,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:17:11,945 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 276 transitions. [2025-02-06 05:17:11,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 4 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-06 05:17:11,945 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 276 transitions. [2025-02-06 05:17:11,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-06 05:17:11,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:11,947 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1] [2025-02-06 05:17:11,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 05:17:12,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:12,147 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:12,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:12,148 INFO L85 PathProgramCache]: Analyzing trace with hash -750505425, now seen corresponding path program 1 times [2025-02-06 05:17:12,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:12,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721674996] [2025-02-06 05:17:12,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:12,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:12,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 05:17:12,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 05:17:12,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:12,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2025-02-06 05:17:12,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:12,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721674996] [2025-02-06 05:17:12,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721674996] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:12,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15115657] [2025-02-06 05:17:12,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:12,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:12,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:12,949 INFO L229 MonitoredProcess]: Starting monitored process 14 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:17:12,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 05:17:13,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 05:17:13,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 05:17:13,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:13,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:13,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 05:17:13,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:13,474 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-02-06 05:17:13,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:17:13,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15115657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:17:13,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:17:13,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16] total 26 [2025-02-06 05:17:13,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145050566] [2025-02-06 05:17:13,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:17:13,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 05:17:13,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:13,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 05:17:13,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2025-02-06 05:17:13,476 INFO L87 Difference]: Start difference. First operand 216 states and 276 transitions. Second operand has 12 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 7 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2025-02-06 05:17:13,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:17:13,928 INFO L93 Difference]: Finished difference Result 373 states and 485 transitions. [2025-02-06 05:17:13,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 05:17:13,928 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 7 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) Word has length 170 [2025-02-06 05:17:13,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:13,930 INFO L225 Difference]: With dead ends: 373 [2025-02-06 05:17:13,930 INFO L226 Difference]: Without dead ends: 218 [2025-02-06 05:17:13,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=1155, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 05:17:13,932 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 176 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 05:17:13,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1164 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 05:17:13,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-06 05:17:13,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 213. [2025-02-06 05:17:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 151 states have (on average 1.205298013245033) internal successors, (182), 152 states have internal predecessors, (182), 40 states have call successors, (40), 20 states have call predecessors, (40), 21 states have return successors, (48), 40 states have call predecessors, (48), 39 states have call successors, (48) [2025-02-06 05:17:13,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 270 transitions. [2025-02-06 05:17:13,963 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 270 transitions. Word has length 170 [2025-02-06 05:17:13,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:17:13,963 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 270 transitions. [2025-02-06 05:17:13,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 7 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2025-02-06 05:17:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 270 transitions. [2025-02-06 05:17:13,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-06 05:17:13,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:13,965 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-02-06 05:17:13,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-06 05:17:14,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:14,166 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:14,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:14,167 INFO L85 PathProgramCache]: Analyzing trace with hash -975275647, now seen corresponding path program 1 times [2025-02-06 05:17:14,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:14,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239647919] [2025-02-06 05:17:14,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:14,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:14,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 05:17:14,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 05:17:14,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:14,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:14,720 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 23 proven. 59 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2025-02-06 05:17:14,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:14,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239647919] [2025-02-06 05:17:14,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239647919] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:14,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346382222] [2025-02-06 05:17:14,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:14,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:14,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:14,723 INFO L229 MonitoredProcess]: Starting monitored process 15 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:17:14,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 05:17:14,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 05:17:14,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 05:17:14,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:14,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:15,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 118 conjuncts are in the unsatisfiable core [2025-02-06 05:17:15,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:15,045 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:17:15,050 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:17:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 144 proven. 25 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-02-06 05:17:15,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:17:16,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 271 treesize of output 263 [2025-02-06 05:17:16,678 INFO L349 Elim1Store]: treesize reduction 294, result has 51.8 percent of original size [2025-02-06 05:17:16,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 4251 treesize of output 4034 [2025-02-06 05:17:16,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:16,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 692 treesize of output 668 [2025-02-06 05:17:16,862 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 626 treesize of output 560 [2025-02-06 05:17:16,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:16,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 602 treesize of output 610 [2025-02-06 05:17:17,023 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 336 treesize of output 294