./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-8fc3dc6-m [2025-03-17 07:19:56,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 07:19:56,672 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 07:19:56,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 07:19:56,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 07:19:56,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 07:19:56,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 07:19:56,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 07:19:56,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 07:19:56,699 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 07:19:56,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 07:19:56,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 07:19:56,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 07:19:56,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 07:19:56,700 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 07:19:56,700 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 07:19:56,700 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 07:19:56,700 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 07:19:56,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 07:19:56,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 07:19:56,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 07:19:56,700 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 07:19:56,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 07:19:56,702 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 07:19:56,703 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 07:19:56,703 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 07:19:56,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 07:19:56,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 07:19:56,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 07:19:56,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 07:19:56,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 07:19:56,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 07:19:56,704 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 07:19:56,704 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 07:19:56,704 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 07:19:56,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 07:19:56,704 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 07:19:56,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 07:19:56,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 07:19:56,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 07:19:56,704 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/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-03-17 07:19:56,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 07:19:56,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 07:19:56,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 07:19:56,972 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 07:19:56,973 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 07:19:56,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness_negated.i [2025-03-17 07:19:58,266 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73fbe5ff/35555bf7c3874902967a89cc0c4ca30d/FLAGb6ed8f6e1 [2025-03-17 07:19:58,711 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 07:19:58,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness_negated.i [2025-03-17 07:19:58,747 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73fbe5ff/35555bf7c3874902967a89cc0c4ca30d/FLAGb6ed8f6e1 [2025-03-17 07:19:58,763 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73fbe5ff/35555bf7c3874902967a89cc0c4ca30d [2025-03-17 07:19:58,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 07:19:58,767 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 07:19:58,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 07:19:58,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 07:19:58,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 07:19:58,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:19:58" (1/1) ... [2025-03-17 07:19:58,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3154dfb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:19:58, skipping insertion in model container [2025-03-17 07:19:58,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:19:58" (1/1) ... [2025-03-17 07:19:58,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 07:19:59,150 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness_negated.i[4501,4514] [2025-03-17 07:19:59,157 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness_negated.i[4561,4574] [2025-03-17 07:19:59,930 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:19:59,931 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:19:59,932 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:19:59,932 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:19:59,933 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:19:59,940 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:19:59,941 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:19:59,942 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:19:59,942 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:20:00,282 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:20:00,283 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:20:00,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 07:20:00,347 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 07:20:00,356 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness_negated.i[4501,4514] [2025-03-17 07:20:00,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness_negated.i[4561,4574] [2025-03-17 07:20:00,405 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:20:00,407 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:20:00,407 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:20:00,407 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:20:00,408 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:20:00,413 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:20:00,414 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:20:00,414 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:20:00,415 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:20:00,477 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:20:00,479 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:20:00,490 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7671-7682] [2025-03-17 07:20:00,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 07:20:00,664 INFO L204 MainTranslator]: Completed translation [2025-03-17 07:20:00,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:00 WrapperNode [2025-03-17 07:20:00,665 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 07:20:00,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 07:20:00,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 07:20:00,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 07:20:00,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:00" (1/1) ... [2025-03-17 07:20:00,720 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:00" (1/1) ... [2025-03-17 07:20:00,766 INFO L138 Inliner]: procedures = 678, calls = 1509, calls flagged for inlining = 54, calls inlined = 9, statements flattened = 621 [2025-03-17 07:20:00,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 07:20:00,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 07:20:00,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 07:20:00,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 07:20:00,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:00" (1/1) ... [2025-03-17 07:20:00,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:00" (1/1) ... [2025-03-17 07:20:00,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:00" (1/1) ... [2025-03-17 07:20:00,865 INFO L175 MemorySlicer]: Split 296 memory accesses to 5 slices as follows [2, 47, 238, 3, 6]. 80 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 0, 6, 1, 5]. The 251 writes are split as follows [0, 18, 232, 1, 0]. [2025-03-17 07:20:00,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:00" (1/1) ... [2025-03-17 07:20:00,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:00" (1/1) ... [2025-03-17 07:20:00,901 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:00" (1/1) ... [2025-03-17 07:20:00,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:00" (1/1) ... [2025-03-17 07:20:00,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:00" (1/1) ... [2025-03-17 07:20:00,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:00" (1/1) ... [2025-03-17 07:20:00,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 07:20:00,931 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 07:20:00,931 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 07:20:00,931 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 07:20:00,932 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:00" (1/1) ... [2025-03-17 07:20:00,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 07:20:00,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:20:00,964 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 07:20:00,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 07:20:00,984 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2025-03-17 07:20:00,984 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2025-03-17 07:20:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 07:20:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2025-03-17 07:20:00,985 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2025-03-17 07:20:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2025-03-17 07:20:00,985 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2025-03-17 07:20:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-03-17 07:20:00,985 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-03-17 07:20:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 07:20:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 07:20:00,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-17 07:20:00,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-17 07:20:00,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-17 07:20:00,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 07:20:00,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 07:20:00,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 07:20:00,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 07:20:00,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 07:20:00,987 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-17 07:20:00,987 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-17 07:20:00,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 07:20:00,987 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 07:20:00,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 07:20:00,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 07:20:00,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 07:20:00,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 07:20:00,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 07:20:00,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 07:20:00,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-17 07:20:00,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 07:20:00,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 07:20:00,988 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_clean_up [2025-03-17 07:20:00,988 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_clean_up [2025-03-17 07:20:00,988 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-03-17 07:20:00,988 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-03-17 07:20:00,988 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-03-17 07:20:00,988 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-03-17 07:20:00,989 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-17 07:20:00,989 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-17 07:20:00,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-17 07:20:00,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-17 07:20:00,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-17 07:20:00,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-17 07:20:00,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-17 07:20:00,989 INFO L130 BoogieDeclarations]: Found specification of procedure aws_priority_queue_is_valid [2025-03-17 07:20:00,989 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_priority_queue_is_valid [2025-03-17 07:20:00,989 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2025-03-17 07:20:00,990 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 07:20:00,990 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-03-17 07:20:00,990 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-17 07:20:00,990 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure memset_impl [2025-03-17 07:20:00,990 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_impl [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2025-03-17 07:20:00,990 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2025-03-17 07:20:00,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 07:20:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 07:20:01,204 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 07:20:01,206 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 07:20:01,252 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc #t~malloc77.base, #t~malloc77.offset; [2025-03-17 07:20:01,256 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc #t~nondet6; [2025-03-17 07:20:01,287 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: havoc #t~ret57#1; [2025-03-17 07:20:01,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7309: havoc #t~ret656.base, #t~ret656.offset; [2025-03-17 07:20:01,373 INFO L1322 $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-03-17 07:20:01,451 INFO L1322 $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-03-17 07:20:01,457 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-03-17 07:20:07,000 INFO L? ?]: Removed 125 outVars from TransFormulas that were not future-live. [2025-03-17 07:20:07,000 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 07:20:07,011 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 07:20:07,013 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 07:20:07,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:20:07 BoogieIcfgContainer [2025-03-17 07:20:07,014 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 07:20:07,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 07:20:07,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 07:20:07,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 07:20:07,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:19:58" (1/3) ... [2025-03-17 07:20:07,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a3dd35f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:20:07, skipping insertion in model container [2025-03-17 07:20:07,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:20:00" (2/3) ... [2025-03-17 07:20:07,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a3dd35f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:20:07, skipping insertion in model container [2025-03-17 07:20:07,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:20:07" (3/3) ... [2025-03-17 07:20:07,021 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_clean_up_harness_negated.i [2025-03-17 07:20:07,033 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 07:20:07,034 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_priority_queue_clean_up_harness_negated.i that has 19 procedures, 171 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-17 07:20:07,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 07:20:07,107 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;@15226d78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 07:20:07,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 07:20:07,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 111 states have (on average 1.2522522522522523) internal successors, (139), 112 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-03-17 07:20:07,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 07:20:07,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:20:07,124 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-03-17 07:20:07,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:20:07,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:20:07,128 INFO L85 PathProgramCache]: Analyzing trace with hash -329028560, now seen corresponding path program 1 times [2025-03-17 07:20:07,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:20:07,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396570650] [2025-03-17 07:20:07,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:20:07,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:20:11,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 07:20:12,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 07:20:12,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:20:12,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:20:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-17 07:20:12,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:20:12,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396570650] [2025-03-17 07:20:12,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396570650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:20:12,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14924077] [2025-03-17 07:20:12,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:20:12,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:20:12,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:20:12,831 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 07:20:12,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 07:20:17,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 07:20:17,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 07:20:17,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:20:17,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:20:17,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 4389 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 07:20:17,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:20:17,848 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-17 07:20:17,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:20:17,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14924077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:20:17,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:20:17,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 07:20:17,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20912091] [2025-03-17 07:20:17,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:20:17,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 07:20:17,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:20:17,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 07:20:17,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 07:20:17,872 INFO L87 Difference]: Start difference. First operand has 171 states, 111 states have (on average 1.2522522522522523) internal successors, (139), 112 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-03-17 07:20:17,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:20:17,902 INFO L93 Difference]: Finished difference Result 318 states and 429 transitions. [2025-03-17 07:20:17,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 07:20:17,903 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-03-17 07:20:17,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:20:17,910 INFO L225 Difference]: With dead ends: 318 [2025-03-17 07:20:17,911 INFO L226 Difference]: Without dead ends: 168 [2025-03-17 07:20:17,914 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-03-17 07:20:17,917 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-03-17 07:20:17,917 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-03-17 07:20:17,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-17 07:20:17,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-03-17 07:20:17,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 110 states have internal predecessors, (133), 41 states have call successors, (41), 18 states have call predecessors, (41), 18 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 07:20:17,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 214 transitions. [2025-03-17 07:20:17,957 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 214 transitions. Word has length 129 [2025-03-17 07:20:17,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:20:17,958 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 214 transitions. [2025-03-17 07:20:17,959 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-03-17 07:20:17,959 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 214 transitions. [2025-03-17 07:20:17,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 07:20:17,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:20:17,963 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] [2025-03-17 07:20:17,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 07:20:18,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 07:20:18,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:20:18,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:20:18,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1560928921, now seen corresponding path program 1 times [2025-03-17 07:20:18,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:20:18,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429289983] [2025-03-17 07:20:18,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:20:18,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:20:22,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 07:20:22,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 07:20:22,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:20:22,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:20:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-17 07:20:23,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:20:23,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429289983] [2025-03-17 07:20:23,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429289983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:20:23,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:20:23,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 07:20:23,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041172661] [2025-03-17 07:20:23,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:20:23,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 07:20:23,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:20:23,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 07:20:23,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 07:20:23,638 INFO L87 Difference]: Start difference. First operand 168 states and 214 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-03-17 07:20:24,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:20:24,055 INFO L93 Difference]: Finished difference Result 260 states and 328 transitions. [2025-03-17 07:20:24,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 07:20:24,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 146 [2025-03-17 07:20:24,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:20:24,061 INFO L225 Difference]: With dead ends: 260 [2025-03-17 07:20:24,061 INFO L226 Difference]: Without dead ends: 168 [2025-03-17 07:20:24,062 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-03-17 07:20:24,062 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 6 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 779 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-03-17 07:20:24,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 779 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 07:20:24,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-17 07:20:24,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-03-17 07:20:24,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 108 states have (on average 1.2222222222222223) internal successors, (132), 110 states have internal predecessors, (132), 41 states have call successors, (41), 18 states have call predecessors, (41), 18 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 07:20:24,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 213 transitions. [2025-03-17 07:20:24,091 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 213 transitions. Word has length 146 [2025-03-17 07:20:24,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:20:24,093 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 213 transitions. [2025-03-17 07:20:24,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-03-17 07:20:24,093 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2025-03-17 07:20:24,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 07:20:24,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:20:24,095 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] [2025-03-17 07:20:24,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 07:20:24,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:20:24,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:20:24,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1872962785, now seen corresponding path program 1 times [2025-03-17 07:20:24,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:20:24,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412783671] [2025-03-17 07:20:24,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:20:24,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:20:28,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 07:20:28,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 07:20:28,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:20:28,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:20:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-17 07:20:29,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:20:29,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412783671] [2025-03-17 07:20:29,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412783671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:20:29,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:20:29,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 07:20:29,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100740574] [2025-03-17 07:20:29,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:20:29,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 07:20:29,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:20:29,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 07:20:29,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 07:20:29,617 INFO L87 Difference]: Start difference. First operand 168 states and 213 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-03-17 07:20:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:20:31,190 INFO L93 Difference]: Finished difference Result 279 states and 357 transitions. [2025-03-17 07:20:31,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 07:20:31,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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 154 [2025-03-17 07:20:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:20:31,198 INFO L225 Difference]: With dead ends: 279 [2025-03-17 07:20:31,198 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 07:20:31,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 07:20:31,205 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 33 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 07:20:31,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1197 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 07:20:31,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 07:20:31,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-03-17 07:20:31,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 112 states have internal predecessors, (133), 41 states have call successors, (41), 18 states have call predecessors, (41), 19 states have return successors, (42), 40 states have call predecessors, (42), 40 states have call successors, (42) [2025-03-17 07:20:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 216 transitions. [2025-03-17 07:20:31,217 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 216 transitions. Word has length 154 [2025-03-17 07:20:31,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:20:31,218 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 216 transitions. [2025-03-17 07:20:31,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-03-17 07:20:31,218 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 216 transitions. [2025-03-17 07:20:31,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 07:20:31,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:20:31,220 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-03-17 07:20:31,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 07:20:31,220 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:20:31,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:20:31,221 INFO L85 PathProgramCache]: Analyzing trace with hash 267623322, now seen corresponding path program 1 times [2025-03-17 07:20:31,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:20:31,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494753144] [2025-03-17 07:20:31,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:20:31,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:20:34,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 07:20:34,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 07:20:34,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:20:34,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:20:36,224 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-17 07:20:36,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:20:36,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494753144] [2025-03-17 07:20:36,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494753144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:20:36,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:20:36,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 07:20:36,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2676775] [2025-03-17 07:20:36,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:20:36,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 07:20:36,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:20:36,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 07:20:36,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 07:20:36,228 INFO L87 Difference]: Start difference. First operand 170 states and 216 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-03-17 07:20:37,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:20:37,156 INFO L93 Difference]: Finished difference Result 265 states and 333 transitions. [2025-03-17 07:20:37,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 07:20:37,157 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-03-17 07:20:37,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:20:37,161 INFO L225 Difference]: With dead ends: 265 [2025-03-17 07:20:37,161 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 07:20:37,162 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-03-17 07:20:37,163 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 23 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 928 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.9s IncrementalHoareTripleChecker+Time [2025-03-17 07:20:37,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 928 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 07:20:37,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 07:20:37,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-03-17 07:20:37,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 112 states have internal predecessors, (132), 41 states have call successors, (41), 18 states have call predecessors, (41), 19 states have return successors, (42), 40 states have call predecessors, (42), 40 states have call successors, (42) [2025-03-17 07:20:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 215 transitions. [2025-03-17 07:20:37,181 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 215 transitions. Word has length 169 [2025-03-17 07:20:37,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:20:37,182 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 215 transitions. [2025-03-17 07:20:37,182 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-03-17 07:20:37,182 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 215 transitions. [2025-03-17 07:20:37,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-17 07:20:37,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:20:37,183 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-03-17 07:20:37,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 07:20:37,184 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:20:37,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:20:37,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1461311298, now seen corresponding path program 1 times [2025-03-17 07:20:37,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:20:37,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011449157] [2025-03-17 07:20:37,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:20:37,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:20:40,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-17 07:20:40,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 07:20:40,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:20:40,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:20:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-17 07:20:42,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:20:42,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011449157] [2025-03-17 07:20:42,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011449157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:20:42,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:20:42,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 07:20:42,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257234102] [2025-03-17 07:20:42,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:20:42,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 07:20:42,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:20:42,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 07:20:42,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 07:20:42,817 INFO L87 Difference]: Start difference. First operand 170 states and 215 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-03-17 07:20:44,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:20:44,774 INFO L93 Difference]: Finished difference Result 278 states and 351 transitions. [2025-03-17 07:20:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 07:20:44,774 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-03-17 07:20:44,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:20:44,777 INFO L225 Difference]: With dead ends: 278 [2025-03-17 07:20:44,777 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 07:20:44,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 07:20:44,779 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 55 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1242 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.8s IncrementalHoareTripleChecker+Time [2025-03-17 07:20:44,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1242 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-17 07:20:44,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 07:20:44,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-03-17 07:20:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 112 states have internal predecessors, (132), 41 states have call successors, (41), 18 states have call predecessors, (41), 19 states have return successors, (41), 40 states have call predecessors, (41), 40 states have call successors, (41) [2025-03-17 07:20:44,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 214 transitions. [2025-03-17 07:20:44,795 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 214 transitions. Word has length 185 [2025-03-17 07:20:44,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:20:44,795 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 214 transitions. [2025-03-17 07:20:44,795 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-03-17 07:20:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2025-03-17 07:20:44,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-17 07:20:44,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:20:44,797 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, 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] [2025-03-17 07:20:44,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 07:20:44,797 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:20:44,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:20:44,798 INFO L85 PathProgramCache]: Analyzing trace with hash 22142699, now seen corresponding path program 1 times [2025-03-17 07:20:44,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:20:44,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548126026] [2025-03-17 07:20:44,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:20:44,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:20:48,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 07:20:48,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 07:20:48,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:20:48,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:20:49,901 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-17 07:20:49,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:20:49,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548126026] [2025-03-17 07:20:49,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548126026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:20:49,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:20:49,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 07:20:49,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087710226] [2025-03-17 07:20:49,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:20:49,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 07:20:49,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:20:49,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 07:20:49,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 07:20:49,903 INFO L87 Difference]: Start difference. First operand 170 states and 214 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-03-17 07:20:50,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:20:50,351 INFO L93 Difference]: Finished difference Result 265 states and 331 transitions. [2025-03-17 07:20:50,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 07:20:50,353 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 200 [2025-03-17 07:20:50,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:20:50,355 INFO L225 Difference]: With dead ends: 265 [2025-03-17 07:20:50,355 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 07:20:50,356 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-03-17 07:20:50,356 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 6 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1018 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-03-17 07:20:50,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1018 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 07:20:50,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 07:20:50,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-03-17 07:20:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 109 states have (on average 1.201834862385321) internal successors, (131), 112 states have internal predecessors, (131), 41 states have call successors, (41), 18 states have call predecessors, (41), 19 states have return successors, (41), 40 states have call predecessors, (41), 40 states have call successors, (41) [2025-03-17 07:20:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 213 transitions. [2025-03-17 07:20:50,370 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 213 transitions. Word has length 200 [2025-03-17 07:20:50,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:20:50,372 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 213 transitions. [2025-03-17 07:20:50,372 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-03-17 07:20:50,372 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 213 transitions. [2025-03-17 07:20:50,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-17 07:20:50,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:20:50,374 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, 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-03-17 07:20:50,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 07:20:50,375 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:20:50,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:20:50,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1217520551, now seen corresponding path program 1 times [2025-03-17 07:20:50,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:20:50,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535811839] [2025-03-17 07:20:50,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:20:50,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:20:53,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 07:20:55,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 07:20:55,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:20:55,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:20:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 07:20:56,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:20:56,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535811839] [2025-03-17 07:20:56,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535811839] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:20:56,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182495856] [2025-03-17 07:20:56,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:20:56,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:20:56,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:20:56,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 07:20:56,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 07:21:00,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 07:21:01,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 07:21:01,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:21:01,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:21:01,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 4846 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 07:21:01,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:21:03,199 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-17 07:21:03,199 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:21:03,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182495856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:21:03,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:21:03,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-03-17 07:21:03,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528420274] [2025-03-17 07:21:03,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:21:03,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 07:21:03,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:21:03,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 07:21:03,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 07:21:03,201 INFO L87 Difference]: Start difference. First operand 170 states and 213 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-17 07:21:07,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 07:21:11,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 07:21:14,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:21:14,864 INFO L93 Difference]: Finished difference Result 285 states and 357 transitions. [2025-03-17 07:21:14,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 07:21:14,865 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 201 [2025-03-17 07:21:14,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:21:14,867 INFO L225 Difference]: With dead ends: 285 [2025-03-17 07:21:14,867 INFO L226 Difference]: Without dead ends: 183 [2025-03-17 07:21:14,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 07:21:14,868 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 37 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2025-03-17 07:21:14,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 941 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 2 Unknown, 0 Unchecked, 11.4s Time] [2025-03-17 07:21:14,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-17 07:21:14,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 174. [2025-03-17 07:21:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 116 states have internal predecessors, (136), 41 states have call successors, (41), 18 states have call predecessors, (41), 19 states have return successors, (41), 40 states have call predecessors, (41), 40 states have call successors, (41) [2025-03-17 07:21:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 218 transitions. [2025-03-17 07:21:14,880 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 218 transitions. Word has length 201 [2025-03-17 07:21:14,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:21:14,888 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 218 transitions. [2025-03-17 07:21:14,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-17 07:21:14,888 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 218 transitions. [2025-03-17 07:21:14,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-17 07:21:14,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:21:14,890 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, 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-03-17 07:21:14,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 07:21:15,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-17 07:21:15,091 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:21:15,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:21:15,099 INFO L85 PathProgramCache]: Analyzing trace with hash 971207464, now seen corresponding path program 1 times [2025-03-17 07:21:15,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:21:15,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256429956] [2025-03-17 07:21:15,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:21:15,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:21:19,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 07:21:19,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 07:21:19,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:21:19,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:21:20,401 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-17 07:21:20,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:21:20,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256429956] [2025-03-17 07:21:20,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256429956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:21:20,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:21:20,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 07:21:20,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010161920] [2025-03-17 07:21:20,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:21:20,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 07:21:20,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:21:20,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 07:21:20,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:21:20,404 INFO L87 Difference]: Start difference. First operand 174 states and 218 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 07:21:20,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:21:20,644 INFO L93 Difference]: Finished difference Result 277 states and 345 transitions. [2025-03-17 07:21:20,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 07:21:20,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 201 [2025-03-17 07:21:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:21:20,647 INFO L225 Difference]: With dead ends: 277 [2025-03-17 07:21:20,647 INFO L226 Difference]: Without dead ends: 177 [2025-03-17 07:21:20,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:21:20,648 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 1 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 07:21:20,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 616 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 07:21:20,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-17 07:21:20,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2025-03-17 07:21:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 115 states have (on average 1.2) internal successors, (138), 118 states have internal predecessors, (138), 41 states have call successors, (41), 18 states have call predecessors, (41), 19 states have return successors, (41), 40 states have call predecessors, (41), 40 states have call successors, (41) [2025-03-17 07:21:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 220 transitions. [2025-03-17 07:21:20,662 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 220 transitions. Word has length 201 [2025-03-17 07:21:20,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:21:20,664 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 220 transitions. [2025-03-17 07:21:20,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 07:21:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 220 transitions. [2025-03-17 07:21:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-17 07:21:20,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:21:20,666 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, 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-03-17 07:21:20,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 07:21:20,667 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:21:20,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:21:20,667 INFO L85 PathProgramCache]: Analyzing trace with hash 363130601, now seen corresponding path program 1 times [2025-03-17 07:21:20,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:21:20,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502421948] [2025-03-17 07:21:20,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:21:20,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms