./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_array_list_copy_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 d7c0f5b67426dc3769ace794e9c8c036d37ffa3960449e6b59343c653ea0c545 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:25:55,979 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:25:56,021 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 01:25:56,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:25:56,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:25:56,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:25:56,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:25:56,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:25:56,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:25:56,041 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:25:56,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:25:56,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:25:56,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:25:56,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:25:56,041 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:25:56,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:25:56,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:25:56,042 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:25:56,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:25:56,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:25:56,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:25:56,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:25:56,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:25:56,042 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:25:56,042 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:25:56,043 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:25:56,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:25:56,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:25:56,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:25:56,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:25:56,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:25:56,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:25:56,043 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:25:56,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:25:56,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:25:56,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:25:56,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:25:56,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:25:56,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:25:56,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:25:56,044 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 -> d7c0f5b67426dc3769ace794e9c8c036d37ffa3960449e6b59343c653ea0c545 [2025-02-08 01:25:56,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:25:56,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:25:56,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:25:56,253 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:25:56,253 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:25:56,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i [2025-02-08 01:25:57,492 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/535f3907c/51938bdfecee43c5807e5d5717cd0efd/FLAG57dbe2ab4 [2025-02-08 01:25:57,895 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:25:57,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i [2025-02-08 01:25:57,926 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/535f3907c/51938bdfecee43c5807e5d5717cd0efd/FLAG57dbe2ab4 [2025-02-08 01:25:58,037 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/535f3907c/51938bdfecee43c5807e5d5717cd0efd [2025-02-08 01:25:58,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:25:58,040 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:25:58,041 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:25:58,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:25:58,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:25:58,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:25:58" (1/1) ... [2025-02-08 01:25:58,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76da090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:25:58, skipping insertion in model container [2025-02-08 01:25:58,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:25:58" (1/1) ... [2025-02-08 01:25:58,121 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:25:58,371 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_array_list_copy_harness.i[4493,4506] [2025-02-08 01:25:58,379 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_array_list_copy_harness.i[4553,4566] [2025-02-08 01:25:59,078 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,079 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,079 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,079 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,080 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,088 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,088 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,089 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,090 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,091 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,091 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,091 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,092 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,387 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,387 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,389 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,393 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:25:59,450 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:25:59,460 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_array_list_copy_harness.i[4493,4506] [2025-02-08 01:25:59,460 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_array_list_copy_harness.i[4553,4566] [2025-02-08 01:25:59,525 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,525 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,525 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,526 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,526 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,530 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,531 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,531 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,532 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,532 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,533 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,533 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,533 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,614 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,614 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,615 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,618 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:25:59,621 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7775-7786] [2025-02-08 01:25:59,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:25:59,803 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:25:59,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:25:59 WrapperNode [2025-02-08 01:25:59,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:25:59,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:25:59,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:25:59,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:25:59,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:25:59" (1/1) ... [2025-02-08 01:25:59,873 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:25:59" (1/1) ... [2025-02-08 01:25:59,920 INFO L138 Inliner]: procedures = 680, calls = 1678, calls flagged for inlining = 52, calls inlined = 7, statements flattened = 718 [2025-02-08 01:25:59,921 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:25:59,921 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:25:59,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:25:59,922 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:25:59,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:25:59" (1/1) ... [2025-02-08 01:25:59,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:25:59" (1/1) ... [2025-02-08 01:25:59,940 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:25:59" (1/1) ... [2025-02-08 01:25:59,995 INFO L175 MemorySlicer]: Split 313 memory accesses to 5 slices as follows [9, 2, 238, 57, 7]. 76 percent of accesses are in the largest equivalence class. The 24 initializations are split as follows [1, 2, 6, 10, 5]. The 241 writes are split as follows [1, 0, 232, 7, 1]. [2025-02-08 01:25:59,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:25:59" (1/1) ... [2025-02-08 01:25:59,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:25:59" (1/1) ... [2025-02-08 01:26:00,029 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:25:59" (1/1) ... [2025-02-08 01:26:00,036 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:25:59" (1/1) ... [2025-02-08 01:26:00,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:25:59" (1/1) ... [2025-02-08 01:26:00,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:25:59" (1/1) ... [2025-02-08 01:26:00,064 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:26:00,067 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:26:00,069 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:26:00,069 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:26:00,070 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:25:59" (1/1) ... [2025-02-08 01:26:00,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:26:00,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:26:00,106 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-08 01:26:00,115 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-08 01:26:00,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 01:26:00,134 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2025-02-08 01:26:00,134 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2025-02-08 01:26:00,135 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-02-08 01:26:00,135 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-02-08 01:26:00,135 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-02-08 01:26:00,135 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 01:26:00,135 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_impl [2025-02-08 01:26:00,135 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_impl [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:26:00,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-02-08 01:26:00,135 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-02-08 01:26:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-02-08 01:26:00,136 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-02-08 01:26:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-08 01:26:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-08 01:26:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-08 01:26:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-08 01:26:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-08 01:26:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2025-02-08 01:26:00,136 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2025-02-08 01:26:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2025-02-08 01:26:00,136 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2025-02-08 01:26:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 01:26:00,136 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 01:26:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure my_memcpy [2025-02-08 01:26:00,136 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memcpy [2025-02-08 01:26:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2025-02-08 01:26:00,136 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2025-02-08 01:26:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 01:26:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 01:26:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 01:26:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 01:26:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 01:26:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 01:26:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 01:26:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 01:26:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 01:26:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 01:26:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 01:26:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-02-08 01:26:00,139 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-02-08 01:26:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-02-08 01:26:00,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-02-08 01:26:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:26:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:26:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 01:26:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 01:26:00,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 01:26:00,140 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2025-02-08 01:26:00,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2025-02-08 01:26:00,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:26:00,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:26:00,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:26:00,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 01:26:00,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 01:26:00,374 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:26:00,376 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:26:00,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc #t~malloc77.base, #t~malloc77.offset; [2025-02-08 01:26:00,438 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: havoc #t~ret57#1; [2025-02-08 01:26:00,469 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L267: havoc nondet_uint8_t_#t~nondet10#1;#t~ret681#1 := nondet_uint8_t_#res#1;havoc nondet_uint8_t_#t~nondet10#1;assume { :end_inline_nondet_uint8_t } true;call write~int#4(#t~ret681#1, ~dst#1.base, ~dst#1.offset + (if ~index~0#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~index~0#1 % 18446744073709551616 % 18446744073709551616 else ~index~0#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1);havoc ~index~0#1;havoc #t~ret681#1; [2025-02-08 01:26:00,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2796: havoc #t~ret81;havoc #t~ite83.base, #t~ite83.offset;havoc #t~ret82.base, #t~ret82.offset; [2025-02-08 01:26:00,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3268: call ULTIMATE.dealloc(~#required_size~0.base, ~#required_size~0.offset);havoc ~#required_size~0.base, ~#required_size~0.offset; [2025-02-08 01:26:00,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-02-08 01:26:00,582 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2821: havoc #t~ret89.base, #t~ret89.offset; [2025-02-08 01:26:00,590 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7396: havoc #t~ret682.base, #t~ret682.offset; [2025-02-08 01:26:05,665 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7513: havoc aws_array_list_copy_#t~ret750#1;call ULTIMATE.dealloc(aws_array_list_copy_~#copy_size~0#1.base, aws_array_list_copy_~#copy_size~0#1.offset);havoc aws_array_list_copy_~#copy_size~0#1.base, aws_array_list_copy_~#copy_size~0#1.offset; [2025-02-08 01:26:05,666 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7491: havoc aws_array_list_copy_~tmp~2#1.base, aws_array_list_copy_~tmp~2#1.offset; [2025-02-08 01:26:05,741 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2025-02-08 01:26:05,741 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:26:05,752 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:26:05,753 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:26:05,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:26:05 BoogieIcfgContainer [2025-02-08 01:26:05,755 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:26:05,756 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:26:05,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:26:05,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:26:05,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:25:58" (1/3) ... [2025-02-08 01:26:05,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c28fb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:26:05, skipping insertion in model container [2025-02-08 01:26:05,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:25:59" (2/3) ... [2025-02-08 01:26:05,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c28fb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:26:05, skipping insertion in model container [2025-02-08 01:26:05,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:26:05" (3/3) ... [2025-02-08 01:26:05,762 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_array_list_copy_harness.i [2025-02-08 01:26:05,773 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:26:05,774 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_array_list_copy_harness.i that has 18 procedures, 205 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-08 01:26:05,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:26:05,840 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;@48f1fe08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:26:05,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 01:26:05,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 113 states have (on average 1.1946902654867257) internal successors, (135), 116 states have internal predecessors, (135), 71 states have call successors, (71), 17 states have call predecessors, (71), 17 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-08 01:26:05,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-08 01:26:05,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:26:05,860 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:26:05,861 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:26:05,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:26:05,866 INFO L85 PathProgramCache]: Analyzing trace with hash 2000755876, now seen corresponding path program 1 times [2025-02-08 01:26:05,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:26:05,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399552954] [2025-02-08 01:26:05,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:26:05,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:26:10,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-08 01:26:10,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-08 01:26:10,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:26:10,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:26:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-02-08 01:26:11,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:26:11,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399552954] [2025-02-08 01:26:11,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399552954] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:26:11,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56347824] [2025-02-08 01:26:11,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:26:11,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:26:11,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:26:11,024 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-08 01:26:11,026 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-08 01:26:15,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-08 01:26:15,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-08 01:26:15,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:26:15,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:26:15,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 4369 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 01:26:15,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:26:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2025-02-08 01:26:15,794 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:26:15,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56347824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:26:15,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:26:15,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-08 01:26:15,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848996523] [2025-02-08 01:26:15,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:26:15,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:26:15,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:26:15,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:26:15,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:26:15,814 INFO L87 Difference]: Start difference. First operand has 205 states, 113 states have (on average 1.1946902654867257) internal successors, (135), 116 states have internal predecessors, (135), 71 states have call successors, (71), 17 states have call predecessors, (71), 17 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-08 01:26:15,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:26:15,853 INFO L93 Difference]: Finished difference Result 407 states and 592 transitions. [2025-02-08 01:26:15,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:26:15,855 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2025-02-08 01:26:15,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:26:15,861 INFO L225 Difference]: With dead ends: 407 [2025-02-08 01:26:15,862 INFO L226 Difference]: Without dead ends: 196 [2025-02-08 01:26:15,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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-08 01:26:15,867 INFO L435 NwaCegarLoop]: 275 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, 275 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-08 01:26:15,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:26:15,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-08 01:26:15,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-02-08 01:26:15,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 109 states have (on average 1.165137614678899) internal successors, (127), 110 states have internal predecessors, (127), 69 states have call successors, (69), 17 states have call predecessors, (69), 17 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-08 01:26:15,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 264 transitions. [2025-02-08 01:26:15,917 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 264 transitions. Word has length 143 [2025-02-08 01:26:15,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:26:15,918 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 264 transitions. [2025-02-08 01:26:15,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-08 01:26:15,919 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 264 transitions. [2025-02-08 01:26:15,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-08 01:26:15,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:26:15,924 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:26:15,940 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-08 01:26:16,128 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-08 01:26:16,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:26:16,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:26:16,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1945933754, now seen corresponding path program 1 times [2025-02-08 01:26:16,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:26:16,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530428203] [2025-02-08 01:26:16,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:26:16,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:26:20,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-08 01:26:20,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-08 01:26:20,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:26:20,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:26:21,486 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2025-02-08 01:26:21,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:26:21,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530428203] [2025-02-08 01:26:21,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530428203] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:26:21,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411419821] [2025-02-08 01:26:21,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:26:21,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:26:21,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:26:21,494 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-08 01:26:21,495 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-08 01:26:26,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-08 01:26:26,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-08 01:26:26,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:26:26,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:26:26,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 4369 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 01:26:26,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:26:26,956 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-02-08 01:26:26,956 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:26:26,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411419821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:26:26,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:26:26,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-08 01:26:26,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692849247] [2025-02-08 01:26:26,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:26:26,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:26:26,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:26:26,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:26:26,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:26:26,960 INFO L87 Difference]: Start difference. First operand 196 states and 264 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-02-08 01:26:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:26:28,111 INFO L93 Difference]: Finished difference Result 388 states and 533 transitions. [2025-02-08 01:26:28,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:26:28,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 143 [2025-02-08 01:26:28,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:26:28,116 INFO L225 Difference]: With dead ends: 388 [2025-02-08 01:26:28,117 INFO L226 Difference]: Without dead ends: 198 [2025-02-08 01:26:28,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:26:28,118 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 54 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:26:28,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 845 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 01:26:28,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-08 01:26:28,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-02-08 01:26:28,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 110 states have (on average 1.1636363636363636) internal successors, (128), 112 states have internal predecessors, (128), 69 states have call successors, (69), 17 states have call predecessors, (69), 18 states have return successors, (80), 68 states have call predecessors, (80), 68 states have call successors, (80) [2025-02-08 01:26:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 277 transitions. [2025-02-08 01:26:28,140 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 277 transitions. Word has length 143 [2025-02-08 01:26:28,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:26:28,140 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 277 transitions. [2025-02-08 01:26:28,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-02-08 01:26:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 277 transitions. [2025-02-08 01:26:28,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-08 01:26:28,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:26:28,142 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:26:28,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 01:26:28,347 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-08 01:26:28,347 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:26:28,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:26:28,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1716810413, now seen corresponding path program 1 times [2025-02-08 01:26:28,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:26:28,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618239187] [2025-02-08 01:26:28,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:26:28,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:26:31,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-08 01:26:32,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-08 01:26:32,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:26:32,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:26:32,777 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2025-02-08 01:26:32,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:26:32,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618239187] [2025-02-08 01:26:32,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618239187] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:26:32,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017509654] [2025-02-08 01:26:32,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:26:32,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:26:32,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:26:32,782 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-08 01:26:32,788 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-08 01:26:37,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-08 01:26:37,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-08 01:26:37,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:26:37,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:26:37,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 4496 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 01:26:37,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:26:38,341 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-02-08 01:26:38,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:26:38,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017509654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:26:38,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:26:38,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-08 01:26:38,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294284704] [2025-02-08 01:26:38,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:26:38,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:26:38,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:26:38,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:26:38,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:26:38,343 INFO L87 Difference]: Start difference. First operand 198 states and 277 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-02-08 01:26:39,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:26:39,374 INFO L93 Difference]: Finished difference Result 364 states and 506 transitions. [2025-02-08 01:26:39,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:26:39,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 157 [2025-02-08 01:26:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:26:39,381 INFO L225 Difference]: With dead ends: 364 [2025-02-08 01:26:39,386 INFO L226 Difference]: Without dead ends: 198 [2025-02-08 01:26:39,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:26:39,387 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 52 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:26:39,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 854 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 01:26:39,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-08 01:26:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-02-08 01:26:39,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 110 states have (on average 1.1636363636363636) internal successors, (128), 112 states have internal predecessors, (128), 69 states have call successors, (69), 17 states have call predecessors, (69), 18 states have return successors, (78), 68 states have call predecessors, (78), 68 states have call successors, (78) [2025-02-08 01:26:39,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 275 transitions. [2025-02-08 01:26:39,414 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 275 transitions. Word has length 157 [2025-02-08 01:26:39,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:26:39,417 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 275 transitions. [2025-02-08 01:26:39,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-02-08 01:26:39,417 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 275 transitions. [2025-02-08 01:26:39,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-08 01:26:39,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:26:39,423 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:26:39,439 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-08 01:26:39,624 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-08 01:26:39,624 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:26:39,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:26:39,625 INFO L85 PathProgramCache]: Analyzing trace with hash 547673056, now seen corresponding path program 2 times [2025-02-08 01:26:39,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:26:39,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001242873] [2025-02-08 01:26:39,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:26:39,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:26:43,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 171 statements into 2 equivalence classes. [2025-02-08 01:26:43,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 171 statements. [2025-02-08 01:26:43,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:26:43,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:26:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2025-02-08 01:26:43,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:26:43,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001242873] [2025-02-08 01:26:43,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001242873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:26:43,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:26:43,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:26:43,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143776851] [2025-02-08 01:26:43,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:26:43,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:26:43,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:26:43,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:26:43,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:26:43,996 INFO L87 Difference]: Start difference. First operand 198 states and 275 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-08 01:26:44,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:26:44,079 INFO L93 Difference]: Finished difference Result 239 states and 324 transitions. [2025-02-08 01:26:44,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:26:44,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 171 [2025-02-08 01:26:44,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:26:44,081 INFO L225 Difference]: With dead ends: 239 [2025-02-08 01:26:44,082 INFO L226 Difference]: Without dead ends: 192 [2025-02-08 01:26:44,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:26:44,083 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 0 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:26:44,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 748 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:26:44,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-08 01:26:44,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-02-08 01:26:44,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 108 states have (on average 1.1574074074074074) internal successors, (125), 110 states have internal predecessors, (125), 65 states have call successors, (65), 17 states have call predecessors, (65), 18 states have return successors, (72), 64 states have call predecessors, (72), 64 states have call successors, (72) [2025-02-08 01:26:44,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 262 transitions. [2025-02-08 01:26:44,102 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 262 transitions. Word has length 171 [2025-02-08 01:26:44,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:26:44,102 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 262 transitions. [2025-02-08 01:26:44,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-08 01:26:44,102 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 262 transitions. [2025-02-08 01:26:44,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-08 01:26:44,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:26:44,106 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:26:44,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:26:44,107 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:26:44,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:26:44,108 INFO L85 PathProgramCache]: Analyzing trace with hash -490282833, now seen corresponding path program 1 times [2025-02-08 01:26:44,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:26:44,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150144336] [2025-02-08 01:26:44,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:26:44,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:26:47,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-08 01:26:47,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-08 01:26:47,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:26:47,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:26:49,024 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2025-02-08 01:26:49,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:26:49,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150144336] [2025-02-08 01:26:49,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150144336] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:26:49,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438678305] [2025-02-08 01:26:49,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:26:49,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:26:49,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:26:49,030 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-08 01:26:49,031 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-08 01:26:53,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-08 01:26:53,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-08 01:26:53,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:26:53,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:26:53,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 4648 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 01:26:53,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:26:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-02-08 01:26:54,820 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:26:54,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438678305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:26:54,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:26:54,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-02-08 01:26:54,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745404687] [2025-02-08 01:26:54,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:26:54,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:26:54,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:26:54,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:26:54,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:26:54,830 INFO L87 Difference]: Start difference. First operand 192 states and 262 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2025-02-08 01:26:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:26:56,060 INFO L93 Difference]: Finished difference Result 341 states and 459 transitions. [2025-02-08 01:26:56,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:26:56,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 174 [2025-02-08 01:26:56,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:26:56,063 INFO L225 Difference]: With dead ends: 341 [2025-02-08 01:26:56,063 INFO L226 Difference]: Without dead ends: 192 [2025-02-08 01:26:56,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:26:56,064 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 74 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:26:56,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1004 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 01:26:56,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-08 01:26:56,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-02-08 01:26:56,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 108 states have (on average 1.1574074074074074) internal successors, (125), 110 states have internal predecessors, (125), 65 states have call successors, (65), 17 states have call predecessors, (65), 18 states have return successors, (68), 64 states have call predecessors, (68), 64 states have call successors, (68) [2025-02-08 01:26:56,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 258 transitions. [2025-02-08 01:26:56,074 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 258 transitions. Word has length 174 [2025-02-08 01:26:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:26:56,075 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 258 transitions. [2025-02-08 01:26:56,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2025-02-08 01:26:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 258 transitions. [2025-02-08 01:26:56,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-08 01:26:56,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:26:56,078 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:26:56,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 01:26:56,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:26:56,279 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:26:56,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:26:56,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1904296242, now seen corresponding path program 1 times [2025-02-08 01:26:56,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:26:56,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531735538] [2025-02-08 01:26:56,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:26:56,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:26:59,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-08 01:27:00,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-08 01:27:00,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:27:00,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:27:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2025-02-08 01:27:00,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:27:00,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531735538] [2025-02-08 01:27:00,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531735538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:27:00,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:27:00,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:27:00,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895457024] [2025-02-08 01:27:00,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:27:00,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:27:00,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:27:00,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:27:00,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:27:00,992 INFO L87 Difference]: Start difference. First operand 192 states and 258 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 4 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-08 01:27:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:27:02,118 INFO L93 Difference]: Finished difference Result 338 states and 446 transitions. [2025-02-08 01:27:02,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:27:02,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 4 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 189 [2025-02-08 01:27:02,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:27:02,121 INFO L225 Difference]: With dead ends: 338 [2025-02-08 01:27:02,121 INFO L226 Difference]: Without dead ends: 190 [2025-02-08 01:27:02,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:27:02,122 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 73 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:27:02,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1014 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 01:27:02,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-08 01:27:02,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2025-02-08 01:27:02,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 107 states have (on average 1.1495327102803738) internal successors, (123), 108 states have internal predecessors, (123), 65 states have call successors, (65), 17 states have call predecessors, (65), 17 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-08 01:27:02,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 252 transitions. [2025-02-08 01:27:02,130 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 252 transitions. Word has length 189 [2025-02-08 01:27:02,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:27:02,131 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 252 transitions. [2025-02-08 01:27:02,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 4 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-08 01:27:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 252 transitions. [2025-02-08 01:27:02,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-08 01:27:02,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:27:02,133 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:27:02,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:27:02,133 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:27:02,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:27:02,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1677551131, now seen corresponding path program 1 times [2025-02-08 01:27:02,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:27:02,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239665881] [2025-02-08 01:27:02,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:27:02,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:27:05,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-08 01:27:05,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-08 01:27:05,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:27:05,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:27:08,644 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2025-02-08 01:27:08,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:27:08,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239665881] [2025-02-08 01:27:08,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239665881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:27:08,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:27:08,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:27:08,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776280841] [2025-02-08 01:27:08,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:27:08,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:27:08,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:27:08,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:27:08,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:27:08,648 INFO L87 Difference]: Start difference. First operand 190 states and 252 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 9 states have internal predecessors, (57), 6 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 7 states have call predecessors, (26), 6 states have call successors, (26) [2025-02-08 01:27:12,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:27:17,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:27:21,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:27:25,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers []