./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness_negated.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ec50af203cf1d5a7d1afbba8c91c6aba29bcfe50c35892731044038eaad7c7f2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:50:37,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:50:37,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 01:50:37,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:50:37,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:50:37,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:50:37,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:50:37,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:50:37,908 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:50:37,909 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:50:37,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:50:37,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:50:37,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:50:37,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:50:37,911 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:50:37,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:50:37,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:50:37,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:50:37,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:50:37,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:50:37,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:50:37,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:50:37,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:50:37,912 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:50:37,912 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:50:37,912 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:50:37,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:50:37,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:50:37,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:50:37,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:50:37,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:50:37,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:50:37,913 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:50:37,913 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:50:37,913 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:50:37,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:50:37,914 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:50:37,914 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:50:37,914 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:50:37,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:50:37,914 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec50af203cf1d5a7d1afbba8c91c6aba29bcfe50c35892731044038eaad7c7f2 [2025-02-08 01:50:38,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:50:38,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:50:38,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:50:38,196 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:50:38,196 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:50:38,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness_negated.i [2025-02-08 01:50:39,521 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95712dca3/1e4d222b89d1407fadc1dcc3536887e6/FLAGa9b003234 [2025-02-08 01:50:40,081 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:50:40,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness_negated.i [2025-02-08 01:50:40,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95712dca3/1e4d222b89d1407fadc1dcc3536887e6/FLAGa9b003234 [2025-02-08 01:50:40,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95712dca3/1e4d222b89d1407fadc1dcc3536887e6 [2025-02-08 01:50:40,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:50:40,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:50:40,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:50:40,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:50:40,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:50:40,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:50:40" (1/1) ... [2025-02-08 01:50:40,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23754c44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:40, skipping insertion in model container [2025-02-08 01:50:40,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:50:40" (1/1) ... [2025-02-08 01:50:40,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:50:40,563 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness_negated.i[4492,4505] [2025-02-08 01:50:40,575 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness_negated.i[4552,4565] [2025-02-08 01:50:42,169 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:42,170 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:42,171 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:42,171 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:42,172 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:42,183 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:42,184 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:42,185 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:42,186 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:42,187 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:42,188 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:42,189 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:42,189 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,220 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,221 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,256 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,256 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,263 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,264 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,280 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,281 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,282 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,282 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,282 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,283 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,283 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,321 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness_negated.i[229379,229392] [2025-02-08 01:50:43,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:50:43,361 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:50:43,374 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness_negated.i[4492,4505] [2025-02-08 01:50:43,375 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness_negated.i[4552,4565] [2025-02-08 01:50:43,415 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,416 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,416 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,416 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,417 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,427 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,427 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,428 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,428 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,429 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,429 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,430 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,430 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7544-7555] [2025-02-08 01:50:43,633 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,634 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,640 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,641 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,644 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,644 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,654 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,655 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,655 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,655 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,655 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,656 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,656 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:43,675 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness_negated.i[229379,229392] [2025-02-08 01:50:43,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:50:43,866 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:50:43,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:43 WrapperNode [2025-02-08 01:50:43,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:50:43,868 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:50:43,868 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:50:43,868 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:50:43,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:43" (1/1) ... [2025-02-08 01:50:43,963 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:43" (1/1) ... [2025-02-08 01:50:44,080 INFO L138 Inliner]: procedures = 764, calls = 2484, calls flagged for inlining = 71, calls inlined = 25, statements flattened = 1463 [2025-02-08 01:50:44,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:50:44,082 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:50:44,082 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:50:44,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:50:44,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:43" (1/1) ... [2025-02-08 01:50:44,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:43" (1/1) ... [2025-02-08 01:50:44,117 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:43" (1/1) ... [2025-02-08 01:50:44,132 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 01:50:44,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:43" (1/1) ... [2025-02-08 01:50:44,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:43" (1/1) ... [2025-02-08 01:50:44,181 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:43" (1/1) ... [2025-02-08 01:50:44,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:43" (1/1) ... [2025-02-08 01:50:44,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:43" (1/1) ... [2025-02-08 01:50:44,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:43" (1/1) ... [2025-02-08 01:50:44,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:50:44,233 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:50:44,234 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:50:44,234 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:50:44,235 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:43" (1/1) ... [2025-02-08 01:50:44,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:50:44,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:50:44,266 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:50:44,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:50:44,289 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2025-02-08 01:50:44,289 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2025-02-08 01:50:44,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-08 01:50:44,289 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_keys_eq [2025-02-08 01:50:44,289 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_keys_eq [2025-02-08 01:50:44,289 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2025-02-08 01:50:44,290 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2025-02-08 01:50:44,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 01:50:44,290 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-02-08 01:50:44,290 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-02-08 01:50:44,290 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-02-08 01:50:44,290 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-02-08 01:50:44,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2025-02-08 01:50:44,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 01:50:44,290 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2025-02-08 01:50:44,290 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2025-02-08 01:50:44,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 01:50:44,291 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-02-08 01:50:44,291 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-02-08 01:50:44,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 01:50:44,291 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 01:50:44,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-08 01:50:44,291 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-02-08 01:50:44,291 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-02-08 01:50:44,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:50:44,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:50:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-02-08 01:50:44,292 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-02-08 01:50:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 01:50:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-02-08 01:50:44,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-02-08 01:50:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2025-02-08 01:50:44,292 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2025-02-08 01:50:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure s_safe_eq_check [2025-02-08 01:50:44,292 INFO L138 BoogieDeclarations]: Found implementation of procedure s_safe_eq_check [2025-02-08 01:50:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure s_emplace_item [2025-02-08 01:50:44,292 INFO L138 BoogieDeclarations]: Found implementation of procedure s_emplace_item [2025-02-08 01:50:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:50:44,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:50:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-02-08 01:50:44,293 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-02-08 01:50:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-02-08 01:50:44,293 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-02-08 01:50:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 01:50:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure s_find_entry [2025-02-08 01:50:44,293 INFO L138 BoogieDeclarations]: Found implementation of procedure s_find_entry [2025-02-08 01:50:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2025-02-08 01:50:44,293 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2025-02-08 01:50:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 01:50:44,293 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 01:50:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 01:50:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-02-08 01:50:44,293 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-02-08 01:50:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 01:50:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-02-08 01:50:44,293 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-02-08 01:50:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 01:50:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-02-08 01:50:44,293 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-02-08 01:50:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-02-08 01:50:44,294 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-02-08 01:50:44,294 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-02-08 01:50:44,294 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-02-08 01:50:44,294 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-02-08 01:50:44,294 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-02-08 01:50:44,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 01:50:44,294 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_for [2025-02-08 01:50:44,294 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_for [2025-02-08 01:50:44,294 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2025-02-08 01:50:44,294 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2025-02-08 01:50:44,294 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-08 01:50:44,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-08 01:50:44,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 01:50:44,294 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-02-08 01:50:44,294 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-02-08 01:50:44,753 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:50:44,755 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:50:44,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6935: havoc #t~malloc588.base, #t~malloc588.offset; [2025-02-08 01:50:44,851 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9974: havoc #t~mem1491.base, #t~mem1491.offset;havoc #t~short1492;havoc #t~mem1493.base, #t~mem1493.offset;havoc #t~ret1494;havoc #t~short1495; [2025-02-08 01:50:44,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-02-08 01:50:44,897 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L10087: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-02-08 01:50:44,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6943: havoc #t~ret589#1;havoc #t~ite591#1.base, #t~ite591#1.offset;havoc #t~ret590#1.base, #t~ret590#1.offset; [2025-02-08 01:50:44,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6928: havoc bounded_calloc_#t~malloc587#1.base, bounded_calloc_#t~malloc587#1.offset;call ULTIMATE.dealloc(bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset);havoc bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset;#t~ret590#1.base, #t~ret590#1.offset := bounded_calloc_#res#1.base, bounded_calloc_#res#1.offset;havoc bounded_calloc_#t~ret585#1, bounded_calloc_#t~mem586#1, bounded_calloc_#t~malloc587#1.base, bounded_calloc_#t~malloc587#1.offset, bounded_calloc_~num#1, bounded_calloc_~size#1, bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset;havoc bounded_calloc_#in~num#1, bounded_calloc_#in~size#1;assume { :end_inline_bounded_calloc } true;#t~ite591#1.base, #t~ite591#1.offset := #t~ret590#1.base, #t~ret590#1.offset; [2025-02-08 01:50:45,220 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: havoc aws_round_up_to_power_of_two_#t~ret62#1; [2025-02-08 01:50:45,220 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9169: call ULTIMATE.dealloc(~#size~0#1.base, ~#size~0#1.offset);havoc ~#size~0#1.base, ~#size~0#1.offset; [2025-02-08 01:50:45,228 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6974: havoc #t~ret600.base, #t~ret600.offset; [2025-02-08 01:50:45,252 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9122-1: assume false; [2025-02-08 01:50:45,252 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9122-1: assume !false; [2025-02-08 01:50:45,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-02-08 01:50:45,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-02-08 01:50:45,319 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9083-1: assume false; [2025-02-08 01:50:45,319 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9083-1: assume !false; [2025-02-08 01:50:45,319 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7341: havoc uninterpreted_hasher_#t~ret689#1; [2025-02-08 01:50:45,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7328-2: uninterpreted_equals_assert_inputs_nonnull_#t~ret687#1 := uninterpreted_equals_#res#1;havoc uninterpreted_equals_#t~ret683#1, uninterpreted_equals_#t~ret684#1, uninterpreted_equals_#t~ret685#1, uninterpreted_equals_#t~ret686#1, uninterpreted_equals_~a#1.base, uninterpreted_equals_~a#1.offset, uninterpreted_equals_~b#1.base, uninterpreted_equals_~b#1.offset, uninterpreted_equals_~rval~9#1;havoc uninterpreted_equals_#in~a#1.base, uninterpreted_equals_#in~a#1.offset, uninterpreted_equals_#in~b#1.base, uninterpreted_equals_#in~b#1.offset;assume { :end_inline_uninterpreted_equals } true;uninterpreted_equals_assert_inputs_nonnull_#res#1 := (if 0 == uninterpreted_equals_assert_inputs_nonnull_#t~ret687#1 % 256 then 0 else 1);havoc uninterpreted_equals_assert_inputs_nonnull_#t~ret687#1; [2025-02-08 01:50:45,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: #res#1 := #t~funptrres1576#1;havoc #t~funptrres1576#1;havoc #t~ret1577#1;havoc #t~ret1578#1; [2025-02-08 01:50:45,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7328: havoc uninterpreted_equals_assert_inputs_nonnull_#t~ret687#1;#t~ret1578#1 := uninterpreted_equals_assert_inputs_nonnull_#res#1;havoc uninterpreted_equals_assert_inputs_nonnull_#t~ret687#1, uninterpreted_equals_assert_inputs_nonnull_~a#1.base, uninterpreted_equals_assert_inputs_nonnull_~a#1.offset, uninterpreted_equals_assert_inputs_nonnull_~b#1.base, uninterpreted_equals_assert_inputs_nonnull_~b#1.offset;havoc uninterpreted_equals_assert_inputs_nonnull_#in~a#1.base, uninterpreted_equals_assert_inputs_nonnull_#in~a#1.offset, uninterpreted_equals_assert_inputs_nonnull_#in~b#1.base, uninterpreted_equals_assert_inputs_nonnull_#in~b#1.offset;assume { :end_inline_uninterpreted_equals_assert_inputs_nonnull } true;#t~funptrres1576#1 := #t~ret1578#1; [2025-02-08 01:50:45,369 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ##fun~$Pointer$~X~$Pointer$~TO~intFINAL: assume true; [2025-02-08 01:50:45,369 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7271: havoc nondet_compare_#t~ret677#1;#t~ret1577#1 := nondet_compare_#res#1;havoc nondet_compare_#t~ret677#1, nondet_compare_~a#1.base, nondet_compare_~a#1.offset, nondet_compare_~b#1.base, nondet_compare_~b#1.offset;havoc nondet_compare_#in~a#1.base, nondet_compare_#in~a#1.offset, nondet_compare_#in~b#1.base, nondet_compare_#in~b#1.offset;assume { :end_inline_nondet_compare } true;assume -2147483648 <= #t~ret1577#1 && #t~ret1577#1 <= 2147483647;#t~funptrres1576#1 := #t~ret1577#1; [2025-02-08 01:50:45,369 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L262: havoc nondet_int_#t~nondet5#1;nondet_compare_#t~ret677#1 := nondet_int_#res#1;havoc nondet_int_#t~nondet5#1;assume { :end_inline_nondet_int } true;assume -2147483648 <= nondet_compare_#t~ret677#1 && nondet_compare_#t~ret677#1 <= 2147483647;nondet_compare_#res#1 := nondet_compare_#t~ret677#1;havoc nondet_compare_#t~ret677#1; [2025-02-08 01:50:45,425 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9109: havoc #t~ret1142; [2025-02-08 01:50:45,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9140: call ULTIMATE.dealloc(~#required_bytes~3#1.base, ~#required_bytes~3#1.offset);havoc ~#required_bytes~3#1.base, ~#required_bytes~3#1.offset; [2025-02-08 01:50:45,568 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6997: call ULTIMATE.dealloc(aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset);havoc aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset; [2025-02-08 01:50:45,661 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9444-1: assume false; [2025-02-08 01:50:45,661 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9444-1: assume !false; [2025-02-08 01:50:45,662 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9403-1: assume false; [2025-02-08 01:50:45,662 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9403-1: assume !false; [2025-02-08 01:50:45,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9311: havoc #t~ret1203#1; [2025-02-08 01:50:45,774 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-02-08 01:50:45,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-02-08 01:50:52,330 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9550: call ULTIMATE.dealloc(aws_hash_table_put_~#p_elem~0#1.base, aws_hash_table_put_~#p_elem~0#1.offset);havoc aws_hash_table_put_~#p_elem~0#1.base, aws_hash_table_put_~#p_elem~0#1.offset;call ULTIMATE.dealloc(aws_hash_table_put_~#was_created_fallback~0#1.base, aws_hash_table_put_~#was_created_fallback~0#1.offset);havoc aws_hash_table_put_~#was_created_fallback~0#1.base, aws_hash_table_put_~#was_created_fallback~0#1.offset; [2025-02-08 01:50:52,330 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9452: call ULTIMATE.dealloc(s_expand_table_~#template~1#1.base, s_expand_table_~#template~1#1.offset);havoc s_expand_table_~#template~1#1.base, s_expand_table_~#template~1#1.offset;call ULTIMATE.dealloc(s_expand_table_~#new_size~0#1.base, s_expand_table_~#new_size~0#1.offset);havoc s_expand_table_~#new_size~0#1.base, s_expand_table_~#new_size~0#1.offset;aws_hash_table_create_#t~ret1281#1 := s_expand_table_#res#1;havoc s_expand_table_#t~mem1245#1.base, s_expand_table_#t~mem1245#1.offset, s_expand_table_#t~mem1246#1.base, s_expand_table_#t~mem1246#1.offset, s_expand_table_#t~mem1247#1.base, s_expand_table_#t~mem1247#1.offset, s_expand_table_#t~mem1248#1.base, s_expand_table_#t~mem1248#1.offset, s_expand_table_#t~mem1249#1.base, s_expand_table_#t~mem1249#1.offset, s_expand_table_#t~mem1250#1.base, s_expand_table_#t~mem1250#1.offset, s_expand_table_#t~mem1251#1, s_expand_table_#t~mem1252#1, s_expand_table_#t~mem1253#1, s_expand_table_#t~mem1254#1, s_expand_table_#t~mem1255#1, s_expand_table_#t~arrayCopy1256#1.element.key.base, s_expand_table_#t~arrayCopy1256#1.element.key.offset, s_expand_table_#t~arrayCopy1256#1.element.value.base, s_expand_table_#t~arrayCopy1256#1.element.value.offset, s_expand_table_#t~arrayCopy1256#1.hash_code, s_expand_table_#t~mem1257#1, s_expand_table_#t~ret1258#1, s_expand_table_#t~mem1259#1, s_expand_table_#t~ret1260#1, s_expand_table_#t~ret1261#1.base, s_expand_table_#t~ret1261#1.offset, s_expand_table_#t~mem1262#1, s_expand_table_#t~mem1263#1.base, s_expand_table_#t~mem1263#1.offset, s_expand_table_#t~mem1264#1.base, s_expand_table_#t~mem1264#1.offset, s_expand_table_#t~mem1265#1, s_expand_table_#t~mem1266#1, s_expand_table_#t~mem1267#1.base, s_expand_table_#t~mem1267#1.offset, s_expand_table_#t~mem1268#1.base, s_expand_table_#t~mem1268#1.offset, s_expand_table_#t~mem1269#1, s_expand_table_#t~ret1270#1.base, s_expand_table_#t~ret1270#1.offset, s_expand_table_~#entry~3#1.base, s_expand_table_~#entry~3#1.offset, s_expand_table_#t~post1271#1, s_expand_table_~i~6#1, s_expand_table_#t~mem1272#1.base, s_expand_table_#t~mem1272#1.offset, s_expand_table_~map#1.base, s_expand_table_~map#1.offset, s_expand_table_~old_state~0#1.base, s_expand_table_~old_state~0#1.offset, s_expand_table_~#template~1#1.base, s_expand_table_~#template~1#1.offset, s_expand_table_~#new_size~0#1.base, s_expand_table_~#new_size~0#1.offset, s_expand_table_~new_state~0#1.base, s_expand_table_~new_state~0#1.offset;havoc s_expand_table_#in~map#1.base, s_expand_table_#in~map#1.offset;assume { :end_inline_s_expand_table } true;assume -2147483648 <= aws_hash_table_create_#t~ret1281#1 && aws_hash_table_create_#t~ret1281#1 <= 2147483647;aws_hash_table_create_~rv~2#1 := aws_hash_table_create_#t~ret1281#1;havoc aws_hash_table_create_#t~ret1281#1; [2025-02-08 01:50:52,331 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6821: havoc aws_hash_table_has_an_empty_slot_#t~mem566#1.base, aws_hash_table_has_an_empty_slot_#t~mem566#1.offset;havoc aws_hash_table_has_an_empty_slot_#t~ret567#1; [2025-02-08 01:50:52,331 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9514: assume 0 != aws_hash_table_create_~rv~2#1;aws_hash_table_create_#res#1 := aws_hash_table_create_~rv~2#1;call ULTIMATE.dealloc(aws_hash_table_create_~#entry~4#1.base, aws_hash_table_create_~#entry~4#1.offset);havoc aws_hash_table_create_~#entry~4#1.base, aws_hash_table_create_~#entry~4#1.offset;call ULTIMATE.dealloc(aws_hash_table_create_~#probe_idx~1#1.base, aws_hash_table_create_~#probe_idx~1#1.offset);havoc aws_hash_table_create_~#probe_idx~1#1.base, aws_hash_table_create_~#probe_idx~1#1.offset;call ULTIMATE.dealloc(aws_hash_table_create_~#ignored~0#1.base, aws_hash_table_create_~#ignored~0#1.offset);havoc aws_hash_table_create_~#ignored~0#1.base, aws_hash_table_create_~#ignored~0#1.offset;call ULTIMATE.dealloc(aws_hash_table_create_~#incr_entry_count~0#1.base, aws_hash_table_create_~#incr_entry_count~0#1.offset);havoc aws_hash_table_create_~#incr_entry_count~0#1.base, aws_hash_table_create_~#incr_entry_count~0#1.offset; [2025-02-08 01:50:52,331 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9514: assume !(0 != aws_hash_table_create_~rv~2#1);call aws_hash_table_create_#t~mem1282#1.base, aws_hash_table_create_#t~mem1282#1.offset := read~$Pointer$(aws_hash_table_create_~map#1.base, aws_hash_table_create_~map#1.offset, 8);aws_hash_table_create_~state~6#1.base, aws_hash_table_create_~state~6#1.offset := aws_hash_table_create_#t~mem1282#1.base, aws_hash_table_create_#t~mem1282#1.offset;havoc aws_hash_table_create_#t~mem1282#1.base, aws_hash_table_create_#t~mem1282#1.offset;call write~int(0, aws_hash_table_create_~#probe_idx~1#1.base, aws_hash_table_create_~#probe_idx~1#1.offset, 8); [2025-02-08 01:50:52,331 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9490: call ULTIMATE.dealloc(aws_hash_table_create_~#entry~4#1.base, aws_hash_table_create_~#entry~4#1.offset);havoc aws_hash_table_create_~#entry~4#1.base, aws_hash_table_create_~#entry~4#1.offset;call ULTIMATE.dealloc(aws_hash_table_create_~#probe_idx~1#1.base, aws_hash_table_create_~#probe_idx~1#1.offset);havoc aws_hash_table_create_~#probe_idx~1#1.base, aws_hash_table_create_~#probe_idx~1#1.offset;call ULTIMATE.dealloc(aws_hash_table_create_~#ignored~0#1.base, aws_hash_table_create_~#ignored~0#1.offset);havoc aws_hash_table_create_~#ignored~0#1.base, aws_hash_table_create_~#ignored~0#1.offset;call ULTIMATE.dealloc(aws_hash_table_create_~#incr_entry_count~0#1.base, aws_hash_table_create_~#incr_entry_count~0#1.offset);havoc aws_hash_table_create_~#incr_entry_count~0#1.base, aws_hash_table_create_~#incr_entry_count~0#1.offset;call ULTIMATE.dealloc(aws_hash_table_create_~#new_entry~0#1.base, aws_hash_table_create_~#new_entry~0#1.offset);havoc aws_hash_table_create_~#new_entry~0#1.base, aws_hash_table_create_~#new_entry~0#1.offset; [2025-02-08 01:50:52,331 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6831: havoc hash_table_state_has_an_empty_slot_#t~mem571#1; [2025-02-08 01:50:52,556 INFO L? ?]: Removed 418 outVars from TransFormulas that were not future-live. [2025-02-08 01:50:52,556 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:50:52,594 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:50:52,595 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:50:52,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:50:52 BoogieIcfgContainer [2025-02-08 01:50:52,595 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:50:52,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:50:52,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:50:52,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:50:52,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:50:40" (1/3) ... [2025-02-08 01:50:52,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a58c6b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:50:52, skipping insertion in model container [2025-02-08 01:50:52,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:43" (2/3) ... [2025-02-08 01:50:52,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a58c6b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:50:52, skipping insertion in model container [2025-02-08 01:50:52,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:50:52" (3/3) ... [2025-02-08 01:50:52,604 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_put_harness_negated.i [2025-02-08 01:50:52,617 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:50:52,618 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_put_harness_negated.i that has 30 procedures, 398 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-02-08 01:50:52,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:50:52,696 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;@1bff9723, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:50:52,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 01:50:52,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 397 states, 274 states have (on average 1.3430656934306568) internal successors, (368), 281 states have internal predecessors, (368), 86 states have call successors, (86), 29 states have call predecessors, (86), 28 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-02-08 01:50:52,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-08 01:50:52,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:50:52,716 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2025-02-08 01:50:52,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:50:52,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:50:52,722 INFO L85 PathProgramCache]: Analyzing trace with hash -774193555, now seen corresponding path program 1 times [2025-02-08 01:50:52,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:50:52,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809413854] [2025-02-08 01:50:52,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:52,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:50:57,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-08 01:50:58,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-08 01:50:58,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:58,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:50:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-02-08 01:50:58,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:50:58,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809413854] [2025-02-08 01:50:58,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809413854] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:50:58,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080859364] [2025-02-08 01:50:58,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:58,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:50:58,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:50:58,680 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:50:58,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 01:51:03,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-08 01:51:03,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-08 01:51:03,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:51:03,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:51:03,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 4496 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 01:51:03,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:51:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-02-08 01:51:03,823 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:51:03,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080859364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:51:03,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:51:03,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-08 01:51:03,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729457925] [2025-02-08 01:51:03,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:51:03,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:51:03,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:51:03,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:51:03,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:51:03,859 INFO L87 Difference]: Start difference. First operand has 397 states, 274 states have (on average 1.3430656934306568) internal successors, (368), 281 states have internal predecessors, (368), 86 states have call successors, (86), 29 states have call predecessors, (86), 28 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-08 01:51:04,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:51:04,083 INFO L93 Difference]: Finished difference Result 787 states and 1122 transitions. [2025-02-08 01:51:04,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:51:04,085 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 130 [2025-02-08 01:51:04,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:51:04,093 INFO L225 Difference]: With dead ends: 787 [2025-02-08 01:51:04,093 INFO L226 Difference]: Without dead ends: 345 [2025-02-08 01:51:04,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:51:04,102 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 01:51:04,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 515 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 01:51:04,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-02-08 01:51:04,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-02-08 01:51:04,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 248 states have (on average 1.2943548387096775) internal successors, (321), 251 states have internal predecessors, (321), 70 states have call successors, (70), 27 states have call predecessors, (70), 26 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-08 01:51:04,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 457 transitions. [2025-02-08 01:51:04,178 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 457 transitions. Word has length 130 [2025-02-08 01:51:04,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:51:04,181 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 457 transitions. [2025-02-08 01:51:04,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-08 01:51:04,181 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 457 transitions. [2025-02-08 01:51:04,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-08 01:51:04,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:51:04,185 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2025-02-08 01:51:04,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 01:51:04,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-08 01:51:04,388 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:51:04,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:51:04,389 INFO L85 PathProgramCache]: Analyzing trace with hash 692111150, now seen corresponding path program 1 times [2025-02-08 01:51:04,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:51:04,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998985939] [2025-02-08 01:51:04,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:51:04,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:51:08,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-08 01:51:08,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-08 01:51:08,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:51:08,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:51:10,094 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-02-08 01:51:10,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:51:10,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998985939] [2025-02-08 01:51:10,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998985939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:51:10,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:51:10,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:51:10,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091909328] [2025-02-08 01:51:10,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:51:10,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:51:10,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:51:10,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:51:10,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:51:10,100 INFO L87 Difference]: Start difference. First operand 345 states and 457 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-08 01:51:10,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:51:10,572 INFO L93 Difference]: Finished difference Result 682 states and 904 transitions. [2025-02-08 01:51:10,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:51:10,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 130 [2025-02-08 01:51:10,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:51:10,580 INFO L225 Difference]: With dead ends: 682 [2025-02-08 01:51:10,581 INFO L226 Difference]: Without dead ends: 345 [2025-02-08 01:51:10,582 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-02-08 01:51:10,583 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 0 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 01:51:10,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1323 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 01:51:10,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-02-08 01:51:10,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-02-08 01:51:10,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 248 states have (on average 1.2903225806451613) internal successors, (320), 251 states have internal predecessors, (320), 70 states have call successors, (70), 27 states have call predecessors, (70), 26 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-08 01:51:10,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 456 transitions. [2025-02-08 01:51:10,612 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 456 transitions. Word has length 130 [2025-02-08 01:51:10,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:51:10,612 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 456 transitions. [2025-02-08 01:51:10,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-08 01:51:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 456 transitions. [2025-02-08 01:51:10,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-08 01:51:10,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:51:10,615 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2025-02-08 01:51:10,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:51:10,615 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:51:10,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:51:10,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1195722961, now seen corresponding path program 1 times [2025-02-08 01:51:10,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:51:10,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316521174] [2025-02-08 01:51:10,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:51:10,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:51:14,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-08 01:51:14,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-08 01:51:14,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:51:14,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:51:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-02-08 01:51:19,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:51:19,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316521174] [2025-02-08 01:51:19,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316521174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:51:19,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:51:19,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:51:19,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966033992] [2025-02-08 01:51:19,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:51:19,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:51:19,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:51:19,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:51:19,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:51:19,044 INFO L87 Difference]: Start difference. First operand 345 states and 456 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2025-02-08 01:51:23,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:51:27,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:51:31,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:51:36,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:51:40,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:51:48,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:51:48,666 INFO L93 Difference]: Finished difference Result 679 states and 896 transitions. [2025-02-08 01:51:48,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:51:48,672 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) Word has length 141 [2025-02-08 01:51:48,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:51:48,676 INFO L225 Difference]: With dead ends: 679 [2025-02-08 01:51:48,676 INFO L226 Difference]: Without dead ends: 353 [2025-02-08 01:51:48,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-08 01:51:48,678 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 11 mSDsluCounter, 2799 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3234 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:51:48,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3234 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 395 Invalid, 5 Unknown, 0 Unchecked, 29.0s Time] [2025-02-08 01:51:48,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-02-08 01:51:48,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 350. [2025-02-08 01:51:48,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 252 states have (on average 1.2896825396825398) internal successors, (325), 256 states have internal predecessors, (325), 70 states have call successors, (70), 27 states have call predecessors, (70), 27 states have return successors, (67), 66 states have call predecessors, (67), 66 states have call successors, (67) [2025-02-08 01:51:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 462 transitions. [2025-02-08 01:51:48,698 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 462 transitions. Word has length 141 [2025-02-08 01:51:48,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:51:48,699 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 462 transitions. [2025-02-08 01:51:48,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2025-02-08 01:51:48,699 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 462 transitions. [2025-02-08 01:51:48,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-08 01:51:48,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:51:48,701 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2025-02-08 01:51:48,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:51:48,701 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:51:48,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:51:48,702 INFO L85 PathProgramCache]: Analyzing trace with hash 990211086, now seen corresponding path program 1 times [2025-02-08 01:51:48,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:51:48,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118491168] [2025-02-08 01:51:48,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:51:48,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:51:52,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-08 01:51:52,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-08 01:51:52,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:51:52,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:51:54,235 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-02-08 01:51:54,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:51:54,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118491168] [2025-02-08 01:51:54,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118491168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:51:54,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:51:54,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:51:54,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967007430] [2025-02-08 01:51:54,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:51:54,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:51:54,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:51:54,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:51:54,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:51:54,238 INFO L87 Difference]: Start difference. First operand 350 states and 462 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-08 01:51:55,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:51:55,988 INFO L93 Difference]: Finished difference Result 686 states and 904 transitions. [2025-02-08 01:51:55,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:51:55,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 141 [2025-02-08 01:51:55,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:51:55,993 INFO L225 Difference]: With dead ends: 686 [2025-02-08 01:51:55,994 INFO L226 Difference]: Without dead ends: 348 [2025-02-08 01:51:55,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:51:55,997 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 71 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-08 01:51:55,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1642 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-08 01:51:55,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-02-08 01:51:56,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2025-02-08 01:51:56,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 250 states have (on average 1.284) internal successors, (321), 254 states have internal predecessors, (321), 70 states have call successors, (70), 27 states have call predecessors, (70), 27 states have return successors, (67), 66 states have call predecessors, (67), 66 states have call successors, (67) [2025-02-08 01:51:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 458 transitions. [2025-02-08 01:51:56,018 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 458 transitions. Word has length 141 [2025-02-08 01:51:56,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:51:56,018 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 458 transitions. [2025-02-08 01:51:56,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-08 01:51:56,019 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 458 transitions. [2025-02-08 01:51:56,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-08 01:51:56,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:51:56,021 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2025-02-08 01:51:56,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:51:56,021 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:51:56,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:51:56,022 INFO L85 PathProgramCache]: Analyzing trace with hash 617572000, now seen corresponding path program 1 times [2025-02-08 01:51:56,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:51:56,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994341455] [2025-02-08 01:51:56,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:51:56,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:51:59,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-08 01:51:59,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-08 01:51:59,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:51:59,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat