./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_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-?-c00e63d-m [2025-02-06 04:49:16,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:49:16,241 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 04:49:16,245 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:49:16,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:49:16,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:49:16,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:49:16,259 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:49:16,259 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:49:16,259 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:49:16,259 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:49:16,260 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:49:16,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:49:16,260 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:49:16,260 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:49:16,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:49:16,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:49:16,260 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:49:16,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:49:16,260 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:49:16,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:49:16,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:49:16,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:49:16,261 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:49:16,261 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:49:16,261 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:49:16,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:49:16,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:49:16,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:49:16,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:49:16,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:49:16,262 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:49:16,262 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:49:16,262 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:49:16,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:49:16,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:49:16,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:49:16,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:49:16,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:49:16,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:49:16,262 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-06 04:49:16,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:49:16,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:49:16,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:49:16,466 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:49:16,466 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:49:16,468 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-06 04:49:17,670 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43e40bf9b/8259ba85bc464a78b0e0d54366d19c7c/FLAGc12c38871 [2025-02-06 04:49:18,102 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:49:18,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i [2025-02-06 04:49:18,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43e40bf9b/8259ba85bc464a78b0e0d54366d19c7c/FLAGc12c38871 [2025-02-06 04:49:18,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43e40bf9b/8259ba85bc464a78b0e0d54366d19c7c [2025-02-06 04:49:18,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:49:18,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:49:18,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:49:18,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:49:18,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:49:18,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:49:18" (1/1) ... [2025-02-06 04:49:18,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474b80d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:49:18, skipping insertion in model container [2025-02-06 04:49:18,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:49:18" (1/1) ... [2025-02-06 04:49:18,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:49:18,365 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-06 04:49:18,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[4553,4566] [2025-02-06 04:49:18,816 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:18,817 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:18,818 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:18,819 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:18,819 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:18,828 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:18,829 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:18,830 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:18,830 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:18,832 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:18,832 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:18,833 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:18,833 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:19,157 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:19,158 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:19,161 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:19,165 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:19,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:49:19,225 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:49:19,235 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-06 04:49:19,235 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-06 04:49:19,275 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:19,275 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:19,275 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:19,276 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:19,276 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:19,280 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:19,280 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:19,281 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:19,281 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:19,282 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:19,282 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:19,282 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:19,283 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:19,325 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:19,326 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:19,326 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:19,330 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 04:49:19,335 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7775-7786] [2025-02-06 04:49:19,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:49:19,490 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:49:19,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:49:19 WrapperNode [2025-02-06 04:49:19,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:49:19,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:49:19,491 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:49:19,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:49:19,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:49:19" (1/1) ... [2025-02-06 04:49:19,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:49:19" (1/1) ... [2025-02-06 04:49:19,562 INFO L138 Inliner]: procedures = 680, calls = 1678, calls flagged for inlining = 52, calls inlined = 7, statements flattened = 718 [2025-02-06 04:49:19,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:49:19,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:49:19,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:49:19,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:49:19,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:49:19" (1/1) ... [2025-02-06 04:49:19,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:49:19" (1/1) ... [2025-02-06 04:49:19,582 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:49:19" (1/1) ... [2025-02-06 04:49:19,645 INFO L175 MemorySlicer]: Split 313 memory accesses to 5 slices as follows [238, 2, 7, 57, 9]. 76 percent of accesses are in the largest equivalence class. The 24 initializations are split as follows [6, 2, 5, 10, 1]. The 241 writes are split as follows [232, 0, 1, 7, 1]. [2025-02-06 04:49:19,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:49:19" (1/1) ... [2025-02-06 04:49:19,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:49:19" (1/1) ... [2025-02-06 04:49:19,682 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:49:19" (1/1) ... [2025-02-06 04:49:19,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:49:19" (1/1) ... [2025-02-06 04:49:19,695 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:49:19" (1/1) ... [2025-02-06 04:49:19,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:49:19" (1/1) ... [2025-02-06 04:49:19,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:49:19,716 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:49:19,716 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:49:19,716 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:49:19,717 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:49:19" (1/1) ... [2025-02-06 04:49:19,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:49:19,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:49:19,746 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:49:19,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:49:19,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 04:49:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2025-02-06 04:49:19,767 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2025-02-06 04:49:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2025-02-06 04:49:19,767 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2025-02-06 04:49:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-02-06 04:49:19,767 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-02-06 04:49:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-02-06 04:49:19,767 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-02-06 04:49:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 04:49:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 04:49:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 04:49:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 04:49:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 04:49:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:49:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:49:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 04:49:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 04:49:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-02-06 04:49:19,768 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 04:49:19,768 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_impl [2025-02-06 04:49:19,768 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_impl [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:49:19,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-02-06 04:49:19,768 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-02-06 04:49:19,768 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2025-02-06 04:49:19,768 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2025-02-06 04:49:19,768 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:49:19,768 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure my_memcpy [2025-02-06 04:49:19,768 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memcpy [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2025-02-06 04:49:19,768 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 04:49:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 04:49:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 04:49:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 04:49:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 04:49:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 04:49:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 04:49:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 04:49:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 04:49:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 04:49:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-06 04:49:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-02-06 04:49:19,769 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-02-06 04:49:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-02-06 04:49:19,769 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-02-06 04:49:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:49:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:49:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 04:49:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 04:49:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 04:49:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2025-02-06 04:49:19,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2025-02-06 04:49:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:49:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:49:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 04:49:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 04:49:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 04:49:19,995 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:49:19,998 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:49:20,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc #t~malloc77.base, #t~malloc77.offset; [2025-02-06 04:49:20,086 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: havoc #t~ret57#1; [2025-02-06 04:49:20,111 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L267: havoc nondet_uint8_t_#t~nondet10#1; [2025-02-06 04:49:20,121 INFO L1309 $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-06 04:49:20,247 INFO L1309 $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-06 04:49:20,251 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-02-06 04:49:20,263 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2821: havoc #t~ret89.base, #t~ret89.offset; [2025-02-06 04:49:20,271 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7396: havoc #t~ret682.base, #t~ret682.offset; [2025-02-06 04:49:25,319 INFO L1309 $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-06 04:49:25,320 INFO L1309 $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-06 04:49:25,420 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-02-06 04:49:25,421 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:49:25,434 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:49:25,435 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:49:25,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:49:25 BoogieIcfgContainer [2025-02-06 04:49:25,435 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:49:25,438 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:49:25,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:49:25,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:49:25,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:49:18" (1/3) ... [2025-02-06 04:49:25,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1609731d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:49:25, skipping insertion in model container [2025-02-06 04:49:25,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:49:19" (2/3) ... [2025-02-06 04:49:25,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1609731d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:49:25, skipping insertion in model container [2025-02-06 04:49:25,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:49:25" (3/3) ... [2025-02-06 04:49:25,446 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_array_list_copy_harness.i [2025-02-06 04:49:25,461 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:49:25,462 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_array_list_copy_harness.i that has 18 procedures, 209 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-06 04:49:25,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:49:25,524 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;@12bf9c21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:49:25,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:49:25,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 119 states have (on average 1.184873949579832) internal successors, (141), 120 states have internal predecessors, (141), 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-06 04:49:25,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 04:49:25,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:49:25,538 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, 1, 1] [2025-02-06 04:49:25,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:49:25,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:49:25,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2126687303, now seen corresponding path program 1 times [2025-02-06 04:49:25,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:49:25,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278071661] [2025-02-06 04:49:25,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:49:25,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:49:30,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 04:49:30,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 04:49:30,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:49:30,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:49:30,709 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-06 04:49:30,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:49:30,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278071661] [2025-02-06 04:49:30,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278071661] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:49:30,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126559770] [2025-02-06 04:49:30,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:49:30,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:49:30,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:49:30,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:49:30,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:49:34,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 04:49:35,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 04:49:35,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:49:35,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:49:35,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 4369 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:49:35,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:49:35,365 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-06 04:49:35,365 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:49:35,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126559770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:49:35,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:49:35,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 04:49:35,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957936673] [2025-02-06 04:49:35,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:49:35,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:49:35,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:49:35,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:49:35,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:49:35,392 INFO L87 Difference]: Start difference. First operand has 209 states, 119 states have (on average 1.184873949579832) internal successors, (141), 120 states have internal predecessors, (141), 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 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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-06 04:49:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:49:35,431 INFO L93 Difference]: Finished difference Result 414 states and 603 transitions. [2025-02-06 04:49:35,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:49:35,433 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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 145 [2025-02-06 04:49:35,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:49:35,438 INFO L225 Difference]: With dead ends: 414 [2025-02-06 04:49:35,440 INFO L226 Difference]: Without dead ends: 204 [2025-02-06 04:49:35,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:49:35,445 INFO L435 NwaCegarLoop]: 281 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, 281 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:49:35,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:49:35,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-02-06 04:49:35,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-02-06 04:49:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 115 states have (on average 1.173913043478261) 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, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 04:49:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 276 transitions. [2025-02-06 04:49:35,494 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 276 transitions. Word has length 145 [2025-02-06 04:49:35,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:49:35,495 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 276 transitions. [2025-02-06 04:49:35,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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-06 04:49:35,496 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 276 transitions. [2025-02-06 04:49:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 04:49:35,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:49:35,501 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, 1, 1] [2025-02-06 04:49:35,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 04:49:35,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 04:49:35,706 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:49:35,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:49:35,707 INFO L85 PathProgramCache]: Analyzing trace with hash 468794211, now seen corresponding path program 1 times [2025-02-06 04:49:35,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:49:35,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975993547] [2025-02-06 04:49:35,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:49:35,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:49:39,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 04:49:39,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 04:49:39,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:49:39,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:49:40,723 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-06 04:49:40,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:49:40,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975993547] [2025-02-06 04:49:40,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975993547] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:49:40,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203370982] [2025-02-06 04:49:40,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:49:40,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:49:40,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:49:40,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:49:40,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:49:45,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 04:49:45,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 04:49:45,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:49:45,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:49:45,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 4369 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 04:49:45,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:49:46,092 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-06 04:49:46,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:49:46,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203370982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:49:46,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:49:46,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2025-02-06 04:49:46,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166426331] [2025-02-06 04:49:46,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:49:46,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:49:46,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:49:46,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:49:46,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:49:46,097 INFO L87 Difference]: Start difference. First operand 204 states and 276 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-06 04:49:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:49:49,039 INFO L93 Difference]: Finished difference Result 403 states and 556 transitions. [2025-02-06 04:49:49,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:49:49,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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 145 [2025-02-06 04:49:49,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:49:49,047 INFO L225 Difference]: With dead ends: 403 [2025-02-06 04:49:49,047 INFO L226 Difference]: Without dead ends: 206 [2025-02-06 04:49:49,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:49:49,049 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 282 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-06 04:49:49,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 779 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-06 04:49:49,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-06 04:49:49,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-02-06 04:49:49,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 116 states have (on average 1.1724137931034482) internal successors, (136), 118 states have internal predecessors, (136), 71 states have call successors, (71), 17 states have call predecessors, (71), 18 states have return successors, (82), 70 states have call predecessors, (82), 70 states have call successors, (82) [2025-02-06 04:49:49,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 289 transitions. [2025-02-06 04:49:49,086 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 289 transitions. Word has length 145 [2025-02-06 04:49:49,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:49:49,086 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 289 transitions. [2025-02-06 04:49:49,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-06 04:49:49,088 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 289 transitions. [2025-02-06 04:49:49,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 04:49:49,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:49:49,090 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, 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, 1] [2025-02-06 04:49:49,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 04:49:49,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:49:49,294 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:49:49,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:49:49,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1404661059, now seen corresponding path program 1 times [2025-02-06 04:49:49,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:49:49,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409818103] [2025-02-06 04:49:49,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:49:49,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:49:53,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 04:49:53,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 04:49:53,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:49:53,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:49:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-02-06 04:49:53,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:49:53,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409818103] [2025-02-06 04:49:53,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409818103] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:49:53,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016471264] [2025-02-06 04:49:53,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:49:53,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:49:53,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:49:53,849 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:49:53,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:49:57,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 04:49:58,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 04:49:58,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:49:58,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:49:58,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 4496 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 04:49:58,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:49:59,121 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-02-06 04:49:59,121 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:49:59,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016471264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:49:59,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:49:59,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2025-02-06 04:49:59,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464279278] [2025-02-06 04:49:59,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:49:59,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:49:59,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:49:59,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:49:59,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:49:59,126 INFO L87 Difference]: Start difference. First operand 206 states and 289 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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-06 04:50:01,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:50:01,843 INFO L93 Difference]: Finished difference Result 379 states and 529 transitions. [2025-02-06 04:50:01,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:50:01,844 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), 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 160 [2025-02-06 04:50:01,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:50:01,848 INFO L225 Difference]: With dead ends: 379 [2025-02-06 04:50:01,849 INFO L226 Difference]: Without dead ends: 206 [2025-02-06 04:50:01,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:50:01,850 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 280 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-06 04:50:01,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 782 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-06 04:50:01,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-06 04:50:01,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-02-06 04:50:01,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 116 states have (on average 1.1724137931034482) internal successors, (136), 118 states have internal predecessors, (136), 71 states have call successors, (71), 17 states have call predecessors, (71), 18 states have return successors, (80), 70 states have call predecessors, (80), 70 states have call successors, (80) [2025-02-06 04:50:01,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2025-02-06 04:50:01,863 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 160 [2025-02-06 04:50:01,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:50:01,863 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2025-02-06 04:50:01,863 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), 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-06 04:50:01,864 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2025-02-06 04:50:01,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-06 04:50:01,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:50:01,865 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 3, 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] [2025-02-06 04:50:01,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 04:50:02,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:50:02,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:50:02,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:50:02,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1219636359, now seen corresponding path program 2 times [2025-02-06 04:50:02,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:50:02,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813466655] [2025-02-06 04:50:02,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:50:02,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:50:05,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 175 statements into 2 equivalence classes. [2025-02-06 04:50:05,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 175 statements. [2025-02-06 04:50:05,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:50:05,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:50:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2025-02-06 04:50:06,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:50:06,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813466655] [2025-02-06 04:50:06,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813466655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:50:06,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:50:06,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:50:06,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922817917] [2025-02-06 04:50:06,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:50:06,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:50:06,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:50:06,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:50:06,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:50:06,513 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-06 04:50:06,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:50:06,675 INFO L93 Difference]: Finished difference Result 265 states and 363 transitions. [2025-02-06 04:50:06,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:50:06,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 175 [2025-02-06 04:50:06,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:50:06,677 INFO L225 Difference]: With dead ends: 265 [2025-02-06 04:50:06,677 INFO L226 Difference]: Without dead ends: 211 [2025-02-06 04:50:06,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:50:06,678 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 0 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 04:50:06,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1086 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 04:50:06,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-02-06 04:50:06,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-02-06 04:50:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 122 states have internal predecessors, (140), 71 states have call successors, (71), 17 states have call predecessors, (71), 19 states have return successors, (82), 71 states have call predecessors, (82), 70 states have call successors, (82) [2025-02-06 04:50:06,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 293 transitions. [2025-02-06 04:50:06,690 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 293 transitions. Word has length 175 [2025-02-06 04:50:06,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:50:06,690 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 293 transitions. [2025-02-06 04:50:06,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-06 04:50:06,691 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 293 transitions. [2025-02-06 04:50:06,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-06 04:50:06,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:50:06,692 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, 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-06 04:50:06,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:50:06,692 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:50:06,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:50:06,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1564517301, now seen corresponding path program 1 times [2025-02-06 04:50:06,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:50:06,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485668098] [2025-02-06 04:50:06,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:50:06,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:50:10,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-06 04:50:10,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-06 04:50:10,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:50:10,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:50:11,424 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-02-06 04:50:11,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:50:11,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485668098] [2025-02-06 04:50:11,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485668098] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:50:11,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386185075] [2025-02-06 04:50:11,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:50:11,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:50:11,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:50:11,430 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:50:11,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:50:15,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-06 04:50:16,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-06 04:50:16,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:50:16,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:50:16,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 4627 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 04:50:16,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:50:17,375 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-02-06 04:50:17,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:50:17,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386185075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:50:17,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:50:17,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-02-06 04:50:17,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2156829] [2025-02-06 04:50:17,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:50:17,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:50:17,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:50:17,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:50:17,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:50:17,377 INFO L87 Difference]: Start difference. First operand 211 states and 293 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2025-02-06 04:50:20,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:50:20,842 INFO L93 Difference]: Finished difference Result 378 states and 520 transitions. [2025-02-06 04:50:20,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:50:20,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) Word has length 181 [2025-02-06 04:50:20,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:50:20,848 INFO L225 Difference]: With dead ends: 378 [2025-02-06 04:50:20,848 INFO L226 Difference]: Without dead ends: 211 [2025-02-06 04:50:20,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-02-06 04:50:20,849 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 308 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:50:20,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 945 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-06 04:50:20,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-02-06 04:50:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-02-06 04:50:20,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 122 states have internal predecessors, (140), 71 states have call successors, (71), 17 states have call predecessors, (71), 19 states have return successors, (77), 71 states have call predecessors, (77), 70 states have call successors, (77) [2025-02-06 04:50:20,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 288 transitions. [2025-02-06 04:50:20,860 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 288 transitions. Word has length 181 [2025-02-06 04:50:20,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:50:20,860 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 288 transitions. [2025-02-06 04:50:20,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2025-02-06 04:50:20,860 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 288 transitions. [2025-02-06 04:50:20,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-06 04:50:20,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:50:20,862 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 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, 1, 1] [2025-02-06 04:50:20,882 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-06 04:50:21,062 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-06 04:50:21,063 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:50:21,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:50:21,064 INFO L85 PathProgramCache]: Analyzing trace with hash -687223814, now seen corresponding path program 1 times [2025-02-06 04:50:21,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:50:21,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629846040] [2025-02-06 04:50:21,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:50:21,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:50:24,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-06 04:50:24,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-06 04:50:24,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:50:24,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:50:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2025-02-06 04:50:25,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:50:25,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629846040] [2025-02-06 04:50:25,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629846040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:50:25,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:50:25,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:50:25,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960259158] [2025-02-06 04:50:25,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:50:25,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:50:25,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:50:25,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:50:25,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:50:25,817 INFO L87 Difference]: Start difference. First operand 211 states and 288 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-06 04:50:26,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:50:26,970 INFO L93 Difference]: Finished difference Result 375 states and 505 transitions. [2025-02-06 04:50:26,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:50:26,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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 195 [2025-02-06 04:50:26,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:50:26,973 INFO L225 Difference]: With dead ends: 375 [2025-02-06 04:50:26,973 INFO L226 Difference]: Without dead ends: 209 [2025-02-06 04:50:26,973 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-06 04:50:26,974 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 79 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:50:26,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1111 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 04:50:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-06 04:50:26,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-02-06 04:50:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 119 states have (on average 1.1596638655462186) internal successors, (138), 120 states have internal predecessors, (138), 71 states have call successors, (71), 17 states have call predecessors, (71), 18 states have return successors, (72), 71 states have call predecessors, (72), 70 states have call successors, (72) [2025-02-06 04:50:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 281 transitions. [2025-02-06 04:50:26,984 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 281 transitions. Word has length 195 [2025-02-06 04:50:26,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:50:26,984 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 281 transitions. [2025-02-06 04:50:26,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-06 04:50:26,985 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 281 transitions. [2025-02-06 04:50:26,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-02-06 04:50:26,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:50:26,986 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 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, 1, 1] [2025-02-06 04:50:26,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:50:26,986 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:50:26,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:50:26,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2126494464, now seen corresponding path program 1 times [2025-02-06 04:50:26,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:50:26,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499554489] [2025-02-06 04:50:26,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:50:26,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:50:30,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-06 04:50:30,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-06 04:50:30,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:50:30,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:50:33,373 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2025-02-06 04:50:33,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:50:33,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499554489] [2025-02-06 04:50:33,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499554489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:50:33,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:50:33,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:50:33,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108057232] [2025-02-06 04:50:33,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:50:33,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:50:33,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:50:33,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:50:33,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:50:33,376 INFO L87 Difference]: Start difference. First operand 209 states and 281 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 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-06 04:50:37,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 04:50:41,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 04:50:53,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:50:53,234 INFO L93 Difference]: Finished difference Result 336 states and 464 transitions. [2025-02-06 04:50:53,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:50:53,235 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 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) Word has length 210 [2025-02-06 04:50:53,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:50:53,237 INFO L225 Difference]: With dead ends: 336 [2025-02-06 04:50:53,237 INFO L226 Difference]: Without dead ends: 285 [2025-02-06 04:50:53,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-02-06 04:50:53,238 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 366 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 82 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:50:53,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1410 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 749 Invalid, 2 Unknown, 0 Unchecked, 18.5s Time] [2025-02-06 04:50:53,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-02-06 04:50:53,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 235. [2025-02-06 04:50:53,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 133 states have (on average 1.1578947368421053) internal successors, (154), 133 states have internal predecessors, (154), 82 states have call successors, (82), 17 states have call predecessors, (82), 19 states have return successors, (86), 84 states have call predecessors, (86), 81 states have call successors, (86) [2025-02-06 04:50:53,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 322 transitions. [2025-02-06 04:50:53,253 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 322 transitions. Word has length 210 [2025-02-06 04:50:53,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:50:53,254 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 322 transitions. [2025-02-06 04:50:53,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 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-06 04:50:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 322 transitions. [2025-02-06 04:50:53,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-02-06 04:50:53,256 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:50:53,256 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:50:53,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:50:53,256 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:50:53,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:50:53,256 INFO L85 PathProgramCache]: Analyzing trace with hash 57929572, now seen corresponding path program 1 times [2025-02-06 04:50:53,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:50:53,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472492506] [2025-02-06 04:50:53,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:50:53,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms