./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness_negated.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c76aa584f17d1e33f139a1a167c9edf580611a597c58d41f9a3cf9cc11662c3e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:54:43,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:54:43,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 01:54:43,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:54:43,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:54:43,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:54:43,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:54:43,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:54:43,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:54:43,907 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:54:43,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:54:43,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:54:43,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:54:43,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:54:43,909 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:54:43,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:54:43,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:54:43,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:54:43,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:54:43,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:54:43,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:54:43,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:54:43,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:54:43,909 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:54:43,909 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:54:43,909 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:54:43,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:54:43,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:54:43,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:54:43,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:54:43,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:54:43,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:54:43,910 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:54:43,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:54:43,910 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:54:43,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:54:43,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:54:43,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:54:43,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:54:43,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:54:43,910 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 -> c76aa584f17d1e33f139a1a167c9edf580611a597c58d41f9a3cf9cc11662c3e [2025-02-08 01:54:44,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:54:44,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:54:44,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:54:44,156 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:54:44,157 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:54:44,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness_negated.i [2025-02-08 01:54:45,296 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e96bb69ab/80ec03a156c24ab48e24ffc504e485f7/FLAG7aff258e7 [2025-02-08 01:54:45,767 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:54:45,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness_negated.i [2025-02-08 01:54:45,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e96bb69ab/80ec03a156c24ab48e24ffc504e485f7/FLAG7aff258e7 [2025-02-08 01:54:45,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e96bb69ab/80ec03a156c24ab48e24ffc504e485f7 [2025-02-08 01:54:45,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:54:45,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:54:45,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:54:45,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:54:45,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:54:45,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:54:45" (1/1) ... [2025-02-08 01:54:45,884 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e403de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:45, skipping insertion in model container [2025-02-08 01:54:45,884 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:54:45" (1/1) ... [2025-02-08 01:54:45,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:54:46,155 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness_negated.i[4501,4514] [2025-02-08 01:54:46,161 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_priority_queue_clean_up_harness_negated.i[4561,4574] [2025-02-08 01:54:46,630 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,631 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,633 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,633 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,634 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,648 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,648 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,652 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,653 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,968 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,969 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:47,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:54:47,029 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:54:47,044 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_priority_queue_clean_up_harness_negated.i[4501,4514] [2025-02-08 01:54:47,044 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_priority_queue_clean_up_harness_negated.i[4561,4574] [2025-02-08 01:54:47,113 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:47,115 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:47,115 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:47,115 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:47,115 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:47,121 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:47,121 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:47,122 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:47,122 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:47,211 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:47,212 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:47,218 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7671-7682] [2025-02-08 01:54:47,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:54:47,373 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:54:47,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:47 WrapperNode [2025-02-08 01:54:47,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:54:47,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:54:47,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:54:47,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:54:47,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:47" (1/1) ... [2025-02-08 01:54:47,436 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:47" (1/1) ... [2025-02-08 01:54:47,481 INFO L138 Inliner]: procedures = 678, calls = 1509, calls flagged for inlining = 54, calls inlined = 9, statements flattened = 621 [2025-02-08 01:54:47,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:54:47,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:54:47,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:54:47,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:54:47,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:47" (1/1) ... [2025-02-08 01:54:47,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:47" (1/1) ... [2025-02-08 01:54:47,498 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:47" (1/1) ... [2025-02-08 01:54:47,556 INFO L175 MemorySlicer]: Split 296 memory accesses to 5 slices as follows [2, 238, 47, 3, 6]. 80 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 6, 0, 1, 5]. The 251 writes are split as follows [0, 232, 18, 1, 0]. [2025-02-08 01:54:47,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:47" (1/1) ... [2025-02-08 01:54:47,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:47" (1/1) ... [2025-02-08 01:54:47,585 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:47" (1/1) ... [2025-02-08 01:54:47,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:47" (1/1) ... [2025-02-08 01:54:47,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:47" (1/1) ... [2025-02-08 01:54:47,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:47" (1/1) ... [2025-02-08 01:54:47,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:54:47,597 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:54:47,597 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:54:47,597 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:54:47,598 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:47" (1/1) ... [2025-02-08 01:54:47,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:54:47,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:54:47,633 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:54:47,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:54:47,650 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2025-02-08 01:54:47,650 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2025-02-08 01:54:47,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 01:54:47,651 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2025-02-08 01:54:47,651 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2025-02-08 01:54:47,652 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2025-02-08 01:54:47,652 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2025-02-08 01:54:47,652 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-02-08 01:54:47,652 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-02-08 01:54:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 01:54:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 01:54:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 01:54:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 01:54:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-08 01:54:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:54:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:54:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 01:54:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 01:54:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 01:54:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-02-08 01:54:47,653 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-02-08 01:54:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 01:54:47,653 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 01:54:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:54:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:54:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:54:47,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_clean_up [2025-02-08 01:54:47,654 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_clean_up [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-02-08 01:54:47,654 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-02-08 01:54:47,654 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-02-08 01:54:47,654 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure aws_priority_queue_is_valid [2025-02-08 01:54:47,654 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_priority_queue_is_valid [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2025-02-08 01:54:47,654 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 01:54:47,654 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 01:54:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 01:54:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 01:54:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-02-08 01:54:47,656 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-02-08 01:54:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-02-08 01:54:47,656 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-02-08 01:54:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:54:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:54:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 01:54:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 01:54:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 01:54:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure memset_impl [2025-02-08 01:54:47,656 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_impl [2025-02-08 01:54:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2025-02-08 01:54:47,656 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2025-02-08 01:54:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2025-02-08 01:54:47,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2025-02-08 01:54:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:54:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:54:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:54:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 01:54:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 01:54:47,892 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:54:47,893 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:54:47,932 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc #t~malloc77.base, #t~malloc77.offset; [2025-02-08 01:54:47,935 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc #t~nondet6; [2025-02-08 01:54:47,959 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: havoc #t~ret57#1; [2025-02-08 01:54:47,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7309: havoc #t~ret656.base, #t~ret656.offset; [2025-02-08 01:54:48,058 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7462: havoc aws_priority_queue_backpointers_valid_#t~ret686#1;havoc aws_priority_queue_backpointers_valid_#t~short687#1; [2025-02-08 01:54:48,101 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3268: call ULTIMATE.dealloc(~#required_size~0.base, ~#required_size~0.offset);havoc ~#required_size~0.base, ~#required_size~0.offset; [2025-02-08 01:54:48,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-02-08 01:54:53,463 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2025-02-08 01:54:53,464 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:54:53,474 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:54:53,476 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:54:53,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:54:53 BoogieIcfgContainer [2025-02-08 01:54:53,476 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:54:53,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:54:53,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:54:53,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:54:53,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:54:45" (1/3) ... [2025-02-08 01:54:53,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11eff3aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:54:53, skipping insertion in model container [2025-02-08 01:54:53,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:47" (2/3) ... [2025-02-08 01:54:53,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11eff3aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:54:53, skipping insertion in model container [2025-02-08 01:54:53,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:54:53" (3/3) ... [2025-02-08 01:54:53,484 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_clean_up_harness_negated.i [2025-02-08 01:54:53,496 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:54:53,497 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_priority_queue_clean_up_harness_negated.i that has 19 procedures, 172 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-08 01:54:53,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:54:53,552 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;@28475264, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:54:53,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 01:54:53,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 172 states, 110 states have (on average 1.2636363636363637) internal successors, (139), 113 states have internal predecessors, (139), 41 states have call successors, (41), 18 states have call predecessors, (41), 18 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-08 01:54:53,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-08 01:54:53,568 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:54:53,568 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:54:53,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:54:53,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:54:53,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1908461333, now seen corresponding path program 1 times [2025-02-08 01:54:53,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:54:53,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911277709] [2025-02-08 01:54:53,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:53,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:54:57,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-08 01:54:58,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-08 01:54:58,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:54:58,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:58,572 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-08 01:54:58,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:54:58,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911277709] [2025-02-08 01:54:58,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911277709] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:54:58,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046393554] [2025-02-08 01:54:58,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:58,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:54:58,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:54:58,577 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:54:58,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 01:55:02,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-08 01:55:03,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-08 01:55:03,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:03,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:03,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 4389 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 01:55:03,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:55:03,330 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-08 01:55:03,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:55:03,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046393554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:55:03,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:55:03,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-08 01:55:03,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788510678] [2025-02-08 01:55:03,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:55:03,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:55:03,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:55:03,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:55:03,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:55:03,353 INFO L87 Difference]: Start difference. First operand has 172 states, 110 states have (on average 1.2636363636363637) internal successors, (139), 113 states have internal predecessors, (139), 41 states have call successors, (41), 18 states have call predecessors, (41), 18 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-08 01:55:03,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:55:03,387 INFO L93 Difference]: Finished difference Result 320 states and 429 transitions. [2025-02-08 01:55:03,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:55:03,388 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2025-02-08 01:55:03,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:55:03,393 INFO L225 Difference]: With dead ends: 320 [2025-02-08 01:55:03,393 INFO L226 Difference]: Without dead ends: 163 [2025-02-08 01:55:03,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:55:03,397 INFO L435 NwaCegarLoop]: 217 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, 217 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:55:03,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:55:03,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-08 01:55:03,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-02-08 01:55:03,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 107 states have internal predecessors, (129), 40 states have call successors, (40), 17 states have call predecessors, (40), 17 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-08 01:55:03,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 208 transitions. [2025-02-08 01:55:03,427 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 208 transitions. Word has length 129 [2025-02-08 01:55:03,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:55:03,428 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 208 transitions. [2025-02-08 01:55:03,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-08 01:55:03,428 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 208 transitions. [2025-02-08 01:55:03,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-08 01:55:03,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:55:03,436 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:55:03,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 01:55:03,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-08 01:55:03,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:55:03,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:55:03,637 INFO L85 PathProgramCache]: Analyzing trace with hash 553380941, now seen corresponding path program 1 times [2025-02-08 01:55:03,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:55:03,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602130610] [2025-02-08 01:55:03,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:03,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:55:07,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-08 01:55:07,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-08 01:55:07,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:07,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-02-08 01:55:08,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:55:08,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602130610] [2025-02-08 01:55:08,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602130610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:55:08,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:55:08,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:55:08,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433496245] [2025-02-08 01:55:08,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:55:08,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:55:08,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:55:08,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:55:08,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:55:08,633 INFO L87 Difference]: Start difference. First operand 163 states and 208 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-08 01:55:09,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:55:09,036 INFO L93 Difference]: Finished difference Result 250 states and 316 transitions. [2025-02-08 01:55:09,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:55:09,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 147 [2025-02-08 01:55:09,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:55:09,038 INFO L225 Difference]: With dead ends: 250 [2025-02-08 01:55:09,038 INFO L226 Difference]: Without dead ends: 163 [2025-02-08 01:55:09,039 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-08 01:55:09,039 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 6 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 01:55:09,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 755 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 01:55:09,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-08 01:55:09,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-02-08 01:55:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 105 states have (on average 1.2190476190476192) internal successors, (128), 107 states have internal predecessors, (128), 40 states have call successors, (40), 17 states have call predecessors, (40), 17 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-08 01:55:09,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 207 transitions. [2025-02-08 01:55:09,052 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 207 transitions. Word has length 147 [2025-02-08 01:55:09,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:55:09,052 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 207 transitions. [2025-02-08 01:55:09,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-08 01:55:09,052 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 207 transitions. [2025-02-08 01:55:09,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-08 01:55:09,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:55:09,054 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:55:09,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:55:09,054 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:55:09,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:55:09,055 INFO L85 PathProgramCache]: Analyzing trace with hash -478904507, now seen corresponding path program 1 times [2025-02-08 01:55:09,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:55:09,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229496451] [2025-02-08 01:55:09,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:09,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:55:12,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-08 01:55:12,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-08 01:55:12,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:12,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-02-08 01:55:14,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:55:14,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229496451] [2025-02-08 01:55:14,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229496451] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:55:14,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:55:14,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:55:14,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022775478] [2025-02-08 01:55:14,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:55:14,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:55:14,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:55:14,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:55:14,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:55:14,014 INFO L87 Difference]: Start difference. First operand 163 states and 207 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-08 01:55:15,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:55:15,265 INFO L93 Difference]: Finished difference Result 269 states and 345 transitions. [2025-02-08 01:55:15,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:55:15,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 155 [2025-02-08 01:55:15,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:55:15,269 INFO L225 Difference]: With dead ends: 269 [2025-02-08 01:55:15,269 INFO L226 Difference]: Without dead ends: 165 [2025-02-08 01:55:15,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:55:15,273 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 33 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:55:15,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1085 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 01:55:15,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-08 01:55:15,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-02-08 01:55:15,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 106 states have (on average 1.2169811320754718) internal successors, (129), 109 states have internal predecessors, (129), 40 states have call successors, (40), 17 states have call predecessors, (40), 18 states have return successors, (41), 39 states have call predecessors, (41), 39 states have call successors, (41) [2025-02-08 01:55:15,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 210 transitions. [2025-02-08 01:55:15,282 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 210 transitions. Word has length 155 [2025-02-08 01:55:15,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:55:15,283 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 210 transitions. [2025-02-08 01:55:15,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-08 01:55:15,284 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 210 transitions. [2025-02-08 01:55:15,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-08 01:55:15,285 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:55:15,285 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:55:15,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:55:15,285 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:55:15,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:55:15,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1382166187, now seen corresponding path program 1 times [2025-02-08 01:55:15,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:55:15,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974711706] [2025-02-08 01:55:15,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:15,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:55:18,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-08 01:55:19,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-08 01:55:19,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:19,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-02-08 01:55:20,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:55:20,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974711706] [2025-02-08 01:55:20,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974711706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:55:20,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:55:20,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:55:20,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078004859] [2025-02-08 01:55:20,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:55:20,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:55:20,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:55:20,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:55:20,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:55:20,099 INFO L87 Difference]: Start difference. First operand 165 states and 210 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2025-02-08 01:55:20,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:55:20,935 INFO L93 Difference]: Finished difference Result 255 states and 321 transitions. [2025-02-08 01:55:20,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:55:20,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) Word has length 169 [2025-02-08 01:55:20,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:55:20,937 INFO L225 Difference]: With dead ends: 255 [2025-02-08 01:55:20,937 INFO L226 Difference]: Without dead ends: 165 [2025-02-08 01:55:20,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:55:20,938 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 23 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 01:55:20,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 898 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 01:55:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-08 01:55:20,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-02-08 01:55:20,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 106 states have (on average 1.2075471698113207) internal successors, (128), 109 states have internal predecessors, (128), 40 states have call successors, (40), 17 states have call predecessors, (40), 18 states have return successors, (41), 39 states have call predecessors, (41), 39 states have call successors, (41) [2025-02-08 01:55:20,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 209 transitions. [2025-02-08 01:55:20,946 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 209 transitions. Word has length 169 [2025-02-08 01:55:20,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:55:20,947 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 209 transitions. [2025-02-08 01:55:20,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2025-02-08 01:55:20,947 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 209 transitions. [2025-02-08 01:55:20,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-08 01:55:20,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:55:20,948 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:55:20,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:55:20,949 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:55:20,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:55:20,949 INFO L85 PathProgramCache]: Analyzing trace with hash -510051579, now seen corresponding path program 1 times [2025-02-08 01:55:20,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:55:20,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388536918] [2025-02-08 01:55:20,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:20,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:55:24,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 01:55:24,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 01:55:24,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:24,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:25,754 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-02-08 01:55:25,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:55:25,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388536918] [2025-02-08 01:55:25,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388536918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:55:25,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:55:25,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:55:25,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74916565] [2025-02-08 01:55:25,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:55:25,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:55:25,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:55:25,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:55:25,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:55:25,757 INFO L87 Difference]: Start difference. First operand 165 states and 209 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 5 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (27), 5 states have call predecessors, (27), 5 states have call successors, (27) [2025-02-08 01:55:27,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:55:27,565 INFO L93 Difference]: Finished difference Result 268 states and 339 transitions. [2025-02-08 01:55:27,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:55:27,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 5 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (27), 5 states have call predecessors, (27), 5 states have call successors, (27) Word has length 185 [2025-02-08 01:55:27,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:55:27,567 INFO L225 Difference]: With dead ends: 268 [2025-02-08 01:55:27,567 INFO L226 Difference]: Without dead ends: 165 [2025-02-08 01:55:27,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:55:27,568 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 55 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-08 01:55:27,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1200 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-08 01:55:27,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-08 01:55:27,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-02-08 01:55:27,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 106 states have (on average 1.2075471698113207) internal successors, (128), 109 states have internal predecessors, (128), 40 states have call successors, (40), 17 states have call predecessors, (40), 18 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-02-08 01:55:27,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 208 transitions. [2025-02-08 01:55:27,583 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 208 transitions. Word has length 185 [2025-02-08 01:55:27,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:55:27,584 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 208 transitions. [2025-02-08 01:55:27,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 5 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (27), 5 states have call predecessors, (27), 5 states have call successors, (27) [2025-02-08 01:55:27,584 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 208 transitions. [2025-02-08 01:55:27,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-08 01:55:27,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:55:27,586 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:55:27,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:55:27,586 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:55:27,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:55:27,586 INFO L85 PathProgramCache]: Analyzing trace with hash -2074458209, now seen corresponding path program 1 times [2025-02-08 01:55:27,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:55:27,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454544736] [2025-02-08 01:55:27,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:27,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:55:31,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-08 01:55:31,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-08 01:55:31,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:31,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:32,513 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-02-08 01:55:32,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:55:32,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454544736] [2025-02-08 01:55:32,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454544736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:55:32,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:55:32,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:55:32,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616295563] [2025-02-08 01:55:32,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:55:32,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:55:32,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:55:32,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:55:32,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:55:32,514 INFO L87 Difference]: Start difference. First operand 165 states and 208 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2025-02-08 01:55:32,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:55:32,958 INFO L93 Difference]: Finished difference Result 255 states and 319 transitions. [2025-02-08 01:55:32,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:55:32,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 199 [2025-02-08 01:55:32,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:55:32,961 INFO L225 Difference]: With dead ends: 255 [2025-02-08 01:55:32,961 INFO L226 Difference]: Without dead ends: 165 [2025-02-08 01:55:32,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:55:32,963 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 6 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 01:55:32,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 988 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 01:55:32,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-08 01:55:32,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-02-08 01:55:32,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 106 states have (on average 1.1981132075471699) internal successors, (127), 109 states have internal predecessors, (127), 40 states have call successors, (40), 17 states have call predecessors, (40), 18 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-02-08 01:55:32,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 207 transitions. [2025-02-08 01:55:32,979 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 207 transitions. Word has length 199 [2025-02-08 01:55:32,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:55:32,982 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 207 transitions. [2025-02-08 01:55:32,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2025-02-08 01:55:32,982 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 207 transitions. [2025-02-08 01:55:32,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-08 01:55:32,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:55:32,984 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:55:32,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:55:32,984 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:55:32,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:55:32,985 INFO L85 PathProgramCache]: Analyzing trace with hash -271072561, now seen corresponding path program 1 times [2025-02-08 01:55:32,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:55:32,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470439934] [2025-02-08 01:55:32,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:32,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:55:36,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-08 01:55:37,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-08 01:55:37,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:37,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-08 01:55:38,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:55:38,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470439934] [2025-02-08 01:55:38,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470439934] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:55:38,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166964426] [2025-02-08 01:55:38,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:38,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:55:38,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:55:38,439 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:55:38,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 01:55:42,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-08 01:55:43,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-08 01:55:43,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:43,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:43,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 4847 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 01:55:43,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:55:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-02-08 01:55:45,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:55:45,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166964426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:55:45,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:55:45,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-02-08 01:55:45,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326312439] [2025-02-08 01:55:45,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:55:45,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:55:45,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:55:45,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:55:45,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:55:45,785 INFO L87 Difference]: Start difference. First operand 165 states and 207 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 5 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) [2025-02-08 01:55:49,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:55:54,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:55:58,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 01:56:03,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:56:07,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 01:56:14,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:56:14,028 INFO L93 Difference]: Finished difference Result 285 states and 361 transitions. [2025-02-08 01:56:14,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:56:14,029 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 5 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) Word has length 200 [2025-02-08 01:56:14,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:56:14,031 INFO L225 Difference]: With dead ends: 285 [2025-02-08 01:56:14,032 INFO L226 Difference]: Without dead ends: 186 [2025-02-08 01:56:14,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-02-08 01:56:14,033 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 53 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:56:14,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1531 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 5 Unknown, 0 Unchecked, 27.0s Time] [2025-02-08 01:56:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-08 01:56:14,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 176. [2025-02-08 01:56:14,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 116 states have (on average 1.206896551724138) internal successors, (140), 119 states have internal predecessors, (140), 40 states have call successors, (40), 17 states have call predecessors, (40), 19 states have return successors, (43), 40 states have call predecessors, (43), 39 states have call successors, (43) [2025-02-08 01:56:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 223 transitions. [2025-02-08 01:56:14,049 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 223 transitions. Word has length 200 [2025-02-08 01:56:14,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:56:14,050 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 223 transitions. [2025-02-08 01:56:14,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 5 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) [2025-02-08 01:56:14,050 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 223 transitions. [2025-02-08 01:56:14,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-08 01:56:14,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:56:14,055 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:56:14,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 01:56:14,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:56:14,256 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:56:14,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:56:14,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1914861486, now seen corresponding path program 1 times [2025-02-08 01:56:14,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:56:14,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957688971] [2025-02-08 01:56:14,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:56:14,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:56:18,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes.