./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_hash_table_create_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 83589103d63582ab3e264b6d8e730d62c6eb0b101bb611ea588c172c43990d87 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:54:13,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:54:13,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:54:13,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:54:13,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:54:13,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:54:13,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:54:13,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:54:13,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:54:13,482 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:54:13,482 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:54:13,482 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:54:13,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:54:13,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:54:13,482 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:54:13,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:54:13,482 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:54:13,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:54:13,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:54:13,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:54:13,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:54:13,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:54:13,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:54:13,482 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:54:13,483 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:54:13,483 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:54:13,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:54:13,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:54:13,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:54:13,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:54:13,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:54:13,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:54:13,483 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:54:13,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:54:13,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:54:13,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:54:13,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:54:13,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:54:13,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:54:13,483 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:54:13,483 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 -> 83589103d63582ab3e264b6d8e730d62c6eb0b101bb611ea588c172c43990d87 [2025-03-04 02:54:13,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:54:13,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:54:13,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:54:13,746 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:54:13,746 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:54:13,748 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness_negated.i [2025-03-04 02:54:14,904 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d30bc44a/740a9ec0afd4434dbc81b1d7669ce4dc/FLAG26ed9fe45 [2025-03-04 02:54:15,427 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:54:15,429 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness_negated.i [2025-03-04 02:54:15,469 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d30bc44a/740a9ec0afd4434dbc81b1d7669ce4dc/FLAG26ed9fe45 [2025-03-04 02:54:15,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d30bc44a/740a9ec0afd4434dbc81b1d7669ce4dc [2025-03-04 02:54:15,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:54:15,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:54:15,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:54:15,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:54:15,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:54:15,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:54:15" (1/1) ... [2025-03-04 02:54:15,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ed9a2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:15, skipping insertion in model container [2025-03-04 02:54:15,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:54:15" (1/1) ... [2025-03-04 02:54:15,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:54:15,823 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_hash_table_create_harness_negated.i[4495,4508] [2025-03-04 02:54:15,831 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_hash_table_create_harness_negated.i[4555,4568] [2025-03-04 02:54:17,188 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,189 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,189 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,189 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,191 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,207 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,207 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,209 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,209 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,210 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,211 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,211 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,211 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,631 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,632 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,665 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,666 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,673 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,674 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,692 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,693 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,694 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,694 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,694 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,694 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,695 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,751 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_hash_table_create_harness_negated.i[229394,229407] [2025-03-04 02:54:18,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:54:18,776 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:54:18,786 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_hash_table_create_harness_negated.i[4495,4508] [2025-03-04 02:54:18,786 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_hash_table_create_harness_negated.i[4555,4568] [2025-03-04 02:54:18,821 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,824 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,825 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,825 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,825 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,830 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,832 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,832 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,833 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,833 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,834 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,834 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,834 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,894 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7544-7555] [2025-03-04 02:54:18,949 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,949 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,953 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,954 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,956 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,956 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,964 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,964 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,965 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,965 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,965 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,966 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,966 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:18,981 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_hash_table_create_harness_negated.i[229394,229407] [2025-03-04 02:54:18,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:54:19,184 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:54:19,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:19 WrapperNode [2025-03-04 02:54:19,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:54:19,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:54:19,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:54:19,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:54:19,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:19" (1/1) ... [2025-03-04 02:54:19,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:19" (1/1) ... [2025-03-04 02:54:19,352 INFO L138 Inliner]: procedures = 764, calls = 2484, calls flagged for inlining = 68, calls inlined = 21, statements flattened = 1368 [2025-03-04 02:54:19,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:54:19,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:54:19,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:54:19,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:54:19,361 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:19" (1/1) ... [2025-03-04 02:54:19,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:19" (1/1) ... [2025-03-04 02:54:19,374 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:19" (1/1) ... [2025-03-04 02:54:19,384 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 02:54:19,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:19" (1/1) ... [2025-03-04 02:54:19,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:19" (1/1) ... [2025-03-04 02:54:19,433 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:19" (1/1) ... [2025-03-04 02:54:19,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:19" (1/1) ... [2025-03-04 02:54:19,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:19" (1/1) ... [2025-03-04 02:54:19,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:19" (1/1) ... [2025-03-04 02:54:19,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:54:19,465 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:54:19,466 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:54:19,466 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:54:19,467 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:19" (1/1) ... [2025-03-04 02:54:19,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:54:19,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:54:19,493 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-04 02:54:19,495 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-04 02:54:19,512 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2025-03-04 02:54:19,513 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2025-03-04 02:54:19,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 02:54:19,513 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_keys_eq [2025-03-04 02:54:19,513 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_keys_eq [2025-03-04 02:54:19,513 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2025-03-04 02:54:19,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2025-03-04 02:54:19,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:54:19,514 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-03-04 02:54:19,514 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-03-04 02:54:19,514 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-03-04 02:54:19,514 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-03-04 02:54:19,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2025-03-04 02:54:19,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 02:54:19,514 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2025-03-04 02:54:19,514 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2025-03-04 02:54:19,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 02:54:19,515 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-04 02:54:19,515 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-04 02:54:19,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:54:19,515 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:54:19,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 02:54:19,515 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_create [2025-03-04 02:54:19,515 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_create [2025-03-04 02:54:19,515 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-03-04 02:54:19,515 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-03-04 02:54:19,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:54:19,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:54:19,515 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-03-04 02:54:19,516 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-03-04 02:54:19,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 02:54:19,516 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2025-03-04 02:54:19,516 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2025-03-04 02:54:19,516 INFO L130 BoogieDeclarations]: Found specification of procedure s_safe_eq_check [2025-03-04 02:54:19,516 INFO L138 BoogieDeclarations]: Found implementation of procedure s_safe_eq_check [2025-03-04 02:54:19,516 INFO L130 BoogieDeclarations]: Found specification of procedure s_emplace_item [2025-03-04 02:54:19,516 INFO L138 BoogieDeclarations]: Found implementation of procedure s_emplace_item [2025-03-04 02:54:19,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:54:19,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:54:19,517 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-03-04 02:54:19,517 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-03-04 02:54:19,517 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-04 02:54:19,517 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-04 02:54:19,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-04 02:54:19,517 INFO L130 BoogieDeclarations]: Found specification of procedure s_find_entry [2025-03-04 02:54:19,517 INFO L138 BoogieDeclarations]: Found implementation of procedure s_find_entry [2025-03-04 02:54:19,517 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2025-03-04 02:54:19,517 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2025-03-04 02:54:19,517 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:54:19,517 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:54:19,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:54:19,517 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-03-04 02:54:19,518 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-03-04 02:54:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 02:54:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-03-04 02:54:19,518 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-03-04 02:54:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 02:54:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-03-04 02:54:19,518 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-03-04 02:54:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-04 02:54:19,519 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-04 02:54:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-03-04 02:54:19,519 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-03-04 02:54:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-04 02:54:19,519 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-04 02:54:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 02:54:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_for [2025-03-04 02:54:19,519 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_for [2025-03-04 02:54:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2025-03-04 02:54:19,519 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2025-03-04 02:54:19,520 INFO L130 BoogieDeclarations]: Found specification of procedure uninterpreted_equals [2025-03-04 02:54:19,520 INFO L138 BoogieDeclarations]: Found implementation of procedure uninterpreted_equals [2025-03-04 02:54:19,520 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-04 02:54:19,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-04 02:54:19,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 02:54:19,520 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-03-04 02:54:19,520 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-03-04 02:54:19,795 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:54:19,798 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:54:19,850 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6935: havoc #t~malloc588.base, #t~malloc588.offset; [2025-03-04 02:54:19,860 INFO L1325 $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-03-04 02:54:19,865 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-03-04 02:54:19,894 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10087: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-03-04 02:54:19,926 INFO L1325 $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-03-04 02:54:19,926 INFO L1325 $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; [2025-03-04 02:54:20,063 INFO L1325 $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-03-04 02:54:20,063 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: havoc aws_round_up_to_power_of_two_#t~ret62#1; [2025-03-04 02:54:20,067 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6974: havoc #t~ret600.base, #t~ret600.offset; [2025-03-04 02:54:20,088 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9122-1: assume false; [2025-03-04 02:54:20,088 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9122-1: assume !false; [2025-03-04 02:54:20,097 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-03-04 02:54:20,098 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-04 02:54:20,114 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9083-1: assume false; [2025-03-04 02:54:20,115 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9083-1: assume !false; [2025-03-04 02:54:20,115 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7341: havoc uninterpreted_hasher_#t~ret689#1; [2025-03-04 02:54:20,134 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7328: havoc uninterpreted_equals_assert_inputs_nonnull_#t~ret687#1; [2025-03-04 02:54:20,134 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7271: havoc nondet_compare_#t~ret677#1; [2025-03-04 02:54:20,134 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L262: havoc nondet_int_#t~nondet5#1; [2025-03-04 02:54:20,238 INFO L1325 $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; [2025-03-04 02:54:20,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9490: call ULTIMATE.dealloc(~#entry~4#1.base, ~#entry~4#1.offset);havoc ~#entry~4#1.base, ~#entry~4#1.offset;call ULTIMATE.dealloc(~#probe_idx~1#1.base, ~#probe_idx~1#1.offset);havoc ~#probe_idx~1#1.base, ~#probe_idx~1#1.offset;call ULTIMATE.dealloc(~#ignored~0#1.base, ~#ignored~0#1.offset);havoc ~#ignored~0#1.base, ~#ignored~0#1.offset;call ULTIMATE.dealloc(~#incr_entry_count~0#1.base, ~#incr_entry_count~0#1.offset);havoc ~#incr_entry_count~0#1.base, ~#incr_entry_count~0#1.offset;call ULTIMATE.dealloc(~#new_entry~0#1.base, ~#new_entry~0#1.offset);havoc ~#new_entry~0#1.base, ~#new_entry~0#1.offset; [2025-03-04 02:54:20,260 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9109: havoc #t~ret1142; [2025-03-04 02:54:20,365 INFO L1325 $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-03-04 02:54:20,365 INFO L1325 $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-03-04 02:54:20,429 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9444-1: assume false; [2025-03-04 02:54:20,429 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9444-1: assume !false; [2025-03-04 02:54:20,429 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9403-1: assume false; [2025-03-04 02:54:20,429 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9403-1: assume !false; [2025-03-04 02:54:20,498 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9311: havoc #t~ret1203#1; [2025-03-04 02:54:20,518 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-03-04 02:54:20,533 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-03-04 02:54:25,757 INFO L1325 $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-03-04 02:54:25,758 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6831: havoc hash_table_state_has_an_empty_slot_#t~mem571#1; [2025-03-04 02:54:25,915 INFO L? ?]: Removed 393 outVars from TransFormulas that were not future-live. [2025-03-04 02:54:25,915 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:54:25,954 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:54:25,954 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:54:25,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:54:25 BoogieIcfgContainer [2025-03-04 02:54:25,954 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:54:25,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:54:25,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:54:25,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:54:25,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:54:15" (1/3) ... [2025-03-04 02:54:25,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3276a6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:54:25, skipping insertion in model container [2025-03-04 02:54:25,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:19" (2/3) ... [2025-03-04 02:54:25,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3276a6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:54:25, skipping insertion in model container [2025-03-04 02:54:25,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:54:25" (3/3) ... [2025-03-04 02:54:25,967 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_create_harness_negated.i [2025-03-04 02:54:25,979 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:54:25,981 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_create_harness_negated.i that has 31 procedures, 399 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-03-04 02:54:26,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:54:26,051 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;@2ea9e6da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:54:26,052 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:54:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 399 states, 285 states have (on average 1.3017543859649123) internal successors, (371), 282 states have internal predecessors, (371), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-04 02:54:26,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 02:54:26,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:54:26,069 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2025-03-04 02:54:26,070 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:54:26,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:54:26,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2053792542, now seen corresponding path program 1 times [2025-03-04 02:54:26,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:54:26,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053935327] [2025-03-04 02:54:26,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:54:26,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:54:30,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 02:54:31,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 02:54:31,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:31,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:54:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 02:54:32,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:54:32,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053935327] [2025-03-04 02:54:32,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053935327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:54:32,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:54:32,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:54:32,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790683623] [2025-03-04 02:54:32,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:54:32,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:54:32,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:54:32,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:54:32,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:54:32,552 INFO L87 Difference]: Start difference. First operand has 399 states, 285 states have (on average 1.3017543859649123) internal successors, (371), 282 states have internal predecessors, (371), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 02:54:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:54:33,312 INFO L93 Difference]: Finished difference Result 797 states and 1149 transitions. [2025-03-04 02:54:33,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:54:33,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 124 [2025-03-04 02:54:33,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:54:33,325 INFO L225 Difference]: With dead ends: 797 [2025-03-04 02:54:33,325 INFO L226 Difference]: Without dead ends: 396 [2025-03-04 02:54:33,330 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-04 02:54:33,334 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 0 mSDsluCounter, 1547 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 02:54:33,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2064 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 02:54:33,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-04 02:54:33,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2025-03-04 02:54:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 278 states have (on average 1.2841726618705036) internal successors, (357), 280 states have internal predecessors, (357), 86 states have call successors, (86), 30 states have call predecessors, (86), 31 states have return successors, (88), 85 states have call predecessors, (88), 84 states have call successors, (88) [2025-03-04 02:54:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 531 transitions. [2025-03-04 02:54:33,391 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 531 transitions. Word has length 124 [2025-03-04 02:54:33,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:54:33,392 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 531 transitions. [2025-03-04 02:54:33,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 02:54:33,393 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 531 transitions. [2025-03-04 02:54:33,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 02:54:33,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:54:33,396 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:54:33,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:54:33,396 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:54:33,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:54:33,397 INFO L85 PathProgramCache]: Analyzing trace with hash -667232171, now seen corresponding path program 1 times [2025-03-04 02:54:33,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:54:33,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187428006] [2025-03-04 02:54:33,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:54:33,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:54:37,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 02:54:37,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 02:54:37,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:37,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:54:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 02:54:38,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:54:38,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187428006] [2025-03-04 02:54:38,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187428006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:54:38,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:54:38,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:54:38,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031050806] [2025-03-04 02:54:38,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:54:38,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:54:38,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:54:38,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:54:38,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:54:38,823 INFO L87 Difference]: Start difference. First operand 396 states and 531 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 02:54:39,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:54:39,512 INFO L93 Difference]: Finished difference Result 778 states and 1043 transitions. [2025-03-04 02:54:39,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:54:39,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 130 [2025-03-04 02:54:39,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:54:39,517 INFO L225 Difference]: With dead ends: 778 [2025-03-04 02:54:39,519 INFO L226 Difference]: Without dead ends: 396 [2025-03-04 02:54:39,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:54:39,523 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 23 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 02:54:39,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1466 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 02:54:39,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-04 02:54:39,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2025-03-04 02:54:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 278 states have (on average 1.2805755395683454) internal successors, (356), 280 states have internal predecessors, (356), 86 states have call successors, (86), 30 states have call predecessors, (86), 31 states have return successors, (88), 85 states have call predecessors, (88), 84 states have call successors, (88) [2025-03-04 02:54:39,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 530 transitions. [2025-03-04 02:54:39,542 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 530 transitions. Word has length 130 [2025-03-04 02:54:39,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:54:39,543 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 530 transitions. [2025-03-04 02:54:39,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 02:54:39,543 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 530 transitions. [2025-03-04 02:54:39,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 02:54:39,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:54:39,545 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:54:39,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:54:39,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:54:39,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:54:39,545 INFO L85 PathProgramCache]: Analyzing trace with hash -458533868, now seen corresponding path program 1 times [2025-03-04 02:54:39,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:54:39,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096331842] [2025-03-04 02:54:39,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:54:39,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:54:43,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 02:54:43,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 02:54:43,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:43,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:54:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 02:54:47,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:54:47,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096331842] [2025-03-04 02:54:47,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096331842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:54:47,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:54:47,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:54:47,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200616718] [2025-03-04 02:54:47,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:54:47,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:54:47,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:54:47,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:54:47,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:54:47,200 INFO L87 Difference]: Start difference. First operand 396 states and 530 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-04 02:54:51,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:54:55,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:55:00,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:55:04,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:55:10,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:55:10,965 INFO L93 Difference]: Finished difference Result 774 states and 1035 transitions. [2025-03-04 02:55:10,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:55:10,971 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 130 [2025-03-04 02:55:10,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:55:10,974 INFO L225 Difference]: With dead ends: 774 [2025-03-04 02:55:10,974 INFO L226 Difference]: Without dead ends: 399 [2025-03-04 02:55:10,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:55:10,975 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 5 mSDsluCounter, 2827 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3329 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:55:10,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3329 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 306 Invalid, 4 Unknown, 0 Unchecked, 23.1s Time] [2025-03-04 02:55:10,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-03-04 02:55:10,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2025-03-04 02:55:10,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 280 states have (on average 1.2785714285714285) internal successors, (358), 283 states have internal predecessors, (358), 86 states have call successors, (86), 30 states have call predecessors, (86), 32 states have return successors, (89), 85 states have call predecessors, (89), 84 states have call successors, (89) [2025-03-04 02:55:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 533 transitions. [2025-03-04 02:55:10,991 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 533 transitions. Word has length 130 [2025-03-04 02:55:10,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:55:10,992 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 533 transitions. [2025-03-04 02:55:10,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-04 02:55:10,992 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 533 transitions. [2025-03-04 02:55:10,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 02:55:10,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:55:10,993 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:55:10,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:55:10,994 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:55:10,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:55:10,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1775146737, now seen corresponding path program 1 times [2025-03-04 02:55:10,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:55:10,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728327078] [2025-03-04 02:55:10,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:55:10,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:55:14,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 02:55:14,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 02:55:14,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:55:14,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:55:17,447 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-04 02:55:17,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:55:17,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728327078] [2025-03-04 02:55:17,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728327078] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:55:17,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807368445] [2025-03-04 02:55:17,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:55:17,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:55:17,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:55:17,451 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-04 02:55:17,452 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-04 02:55:21,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 02:55:22,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 02:55:22,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:55:22,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:55:22,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 4440 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 02:55:22,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:55:28,136 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_aws_hash_table_is_valid_~map.base_4 Int) (v_aws_hash_table_is_valid_~map.offset_4 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_hash_table_is_valid_~map.base_4) v_aws_hash_table_is_valid_~map.offset_4) 0))) (exists ((v_aws_hash_table_is_valid_~map.base_4 Int) (v_aws_hash_table_is_valid_~map.offset_4 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_hash_table_is_valid_~map.base_4) v_aws_hash_table_is_valid_~map.offset_4) 0)))) is different from true [2025-03-04 02:55:37,285 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 02:55:37,285 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:55:37,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807368445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:55:37,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:55:37,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2025-03-04 02:55:37,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685367954] [2025-03-04 02:55:37,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:55:37,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:55:37,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:55:37,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:55:37,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=105, Unknown=3, NotChecked=20, Total=156 [2025-03-04 02:55:37,287 INFO L87 Difference]: Start difference. First operand 399 states and 533 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-04 02:55:41,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:55:45,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers []