./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.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_init_unbounded_harness.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c061a12cbc38eba33828b4010e38aa9d2f9e1471733e9a6b829e0f771d8d2fcd --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:50:31,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:50:31,172 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:31,177 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:50:31,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:50:31,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:50:31,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:50:31,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:50:31,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:50:31,202 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:50:31,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:50:31,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:50:31,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:50:31,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:50:31,204 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:50:31,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:50:31,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:50:31,204 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:50:31,204 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:50:31,204 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:50:31,204 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:50:31,204 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:50:31,205 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:50:31,205 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:50:31,205 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:50:31,205 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:50:31,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:50:31,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:50:31,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:50:31,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:50:31,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:50:31,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:50:31,205 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:50:31,206 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:50:31,206 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:50:31,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:50:31,206 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:50:31,206 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:50:31,206 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:50:31,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:50:31,207 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 -> c061a12cbc38eba33828b4010e38aa9d2f9e1471733e9a6b829e0f771d8d2fcd [2025-02-08 01:50:31,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:50:31,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:50:31,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:50:31,436 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:50:31,436 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:50:31,437 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_init_unbounded_harness.i [2025-02-08 01:50:32,630 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9028bade/d4efb73a5c4b4cdc8c02d828d4a41154/FLAGb5da95345 [2025-02-08 01:50:33,174 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:50:33,175 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i [2025-02-08 01:50:33,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9028bade/d4efb73a5c4b4cdc8c02d828d4a41154/FLAGb5da95345 [2025-02-08 01:50:33,232 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9028bade/d4efb73a5c4b4cdc8c02d828d4a41154 [2025-02-08 01:50:33,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:50:33,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:50:33,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:50:33,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:50:33,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:50:33,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:50:33" (1/1) ... [2025-02-08 01:50:33,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@115de5f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:33, skipping insertion in model container [2025-02-08 01:50:33,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:50:33" (1/1) ... [2025-02-08 01:50:33,336 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:50:33,523 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_init_unbounded_harness.i[4503,4516] [2025-02-08 01:50:33,530 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_init_unbounded_harness.i[4563,4576] [2025-02-08 01:50:34,242 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:34,242 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:34,243 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:34,243 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:34,244 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:34,255 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:34,255 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:34,256 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:34,256 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:34,257 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:34,258 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:34,258 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:34,259 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,197 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,198 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,215 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,216 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,220 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,221 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,231 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,231 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,232 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,232 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,232 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,232 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,232 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,262 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_init_unbounded_harness.i[227916,227929] [2025-02-08 01:50:35,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:50:35,292 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:50:35,301 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_init_unbounded_harness.i[4503,4516] [2025-02-08 01:50:35,302 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_init_unbounded_harness.i[4563,4576] [2025-02-08 01:50:35,324 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,325 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,325 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,325 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,325 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,329 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,329 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,330 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,330 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,330 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,331 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,331 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,331 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,392 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7576-7587] [2025-02-08 01:50:35,489 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,489 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,494 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,495 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,496 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,496 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,502 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,502 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,502 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,503 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,503 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,503 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,503 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:35,515 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_init_unbounded_harness.i[227916,227929] [2025-02-08 01:50:35,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:50:35,686 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:50:35,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:35 WrapperNode [2025-02-08 01:50:35,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:50:35,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:50:35,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:50:35,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:50:35,692 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:35" (1/1) ... [2025-02-08 01:50:35,767 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:35" (1/1) ... [2025-02-08 01:50:35,825 INFO L138 Inliner]: procedures = 764, calls = 2425, calls flagged for inlining = 66, calls inlined = 11, statements flattened = 831 [2025-02-08 01:50:35,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:50:35,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:50:35,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:50:35,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:50:35,843 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:35" (1/1) ... [2025-02-08 01:50:35,843 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:35" (1/1) ... [2025-02-08 01:50:35,851 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:35" (1/1) ... [2025-02-08 01:50:35,859 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 01:50:35,860 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:35" (1/1) ... [2025-02-08 01:50:35,860 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:35" (1/1) ... [2025-02-08 01:50:35,897 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:35" (1/1) ... [2025-02-08 01:50:35,900 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:35" (1/1) ... [2025-02-08 01:50:35,907 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:35" (1/1) ... [2025-02-08 01:50:35,909 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:35" (1/1) ... [2025-02-08 01:50:35,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:50:35,920 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:50:35,921 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:50:35,921 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:50:35,922 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:35" (1/1) ... [2025-02-08 01:50:35,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:50:35,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:50:35,953 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:35,959 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:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2025-02-08 01:50:35,972 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2025-02-08 01:50:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-08 01:50:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 01:50:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-02-08 01:50:35,972 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-02-08 01:50:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-02-08 01:50:35,972 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-02-08 01:50:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 01:50:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2025-02-08 01:50:35,972 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2025-02-08 01:50:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 01:50:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-02-08 01:50:35,972 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-02-08 01:50:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 01:50:35,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 01:50:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-08 01:50:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-02-08 01:50:35,972 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-02-08 01:50:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:50:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:50:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-02-08 01:50:35,972 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-02-08 01:50:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 01:50:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:50:35,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:50:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-02-08 01:50:35,973 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-02-08 01:50:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-02-08 01:50:35,973 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-02-08 01:50:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 01:50:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 01:50:35,973 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 01:50:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 01:50:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-02-08 01:50:35,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-02-08 01:50:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 01:50:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-02-08 01:50:35,973 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-02-08 01:50:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 01:50:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-02-08 01:50:35,973 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-02-08 01:50:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-02-08 01:50:35,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-02-08 01:50:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-02-08 01:50:35,973 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-02-08 01:50:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 01:50:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2025-02-08 01:50:35,973 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2025-02-08 01:50:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 01:50:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-02-08 01:50:35,973 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-02-08 01:50:36,220 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:50:36,225 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:50:36,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L10008: 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:36,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-02-08 01:50:36,314 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L10121: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-02-08 01:50:36,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6940: 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:36,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6955: 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:36,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: havoc aws_round_up_to_power_of_two_#t~ret62#1; [2025-02-08 01:50:36,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9201: 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:36,493 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6986: havoc #t~ret600.base, #t~ret600.offset; [2025-02-08 01:50:36,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc #t~nondet6; [2025-02-08 01:50:36,511 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-02-08 01:50:36,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7009: 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:36,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9172: 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:36,711 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-02-08 01:50:36,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-02-08 01:50:41,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9260-1: assume false; [2025-02-08 01:50:41,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9260-1: assume !false; [2025-02-08 01:50:41,893 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2025-02-08 01:50:41,893 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:50:41,908 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:50:41,908 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:50:41,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:50:41 BoogieIcfgContainer [2025-02-08 01:50:41,908 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:50:41,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:50:41,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:50:41,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:50:41,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:50:33" (1/3) ... [2025-02-08 01:50:41,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b703045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:50:41, skipping insertion in model container [2025-02-08 01:50:41,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:35" (2/3) ... [2025-02-08 01:50:41,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b703045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:50:41, skipping insertion in model container [2025-02-08 01:50:41,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:50:41" (3/3) ... [2025-02-08 01:50:41,914 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_init_unbounded_harness.i [2025-02-08 01:50:41,928 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:50:41,931 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_init_unbounded_harness.i that has 19 procedures, 188 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 01:50:41,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:50:41,981 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;@5d2a5ada, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:50:41,982 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 01:50:41,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 128 states have (on average 1.3046875) internal successors, (167), 134 states have internal predecessors, (167), 35 states have call successors, (35), 18 states have call predecessors, (35), 18 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-08 01:50:41,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-08 01:50:41,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:50:41,996 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,997 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:50:42,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:50:42,002 INFO L85 PathProgramCache]: Analyzing trace with hash 11291521, now seen corresponding path program 1 times [2025-02-08 01:50:42,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:50:42,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145132348] [2025-02-08 01:50:42,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:42,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:50:46,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 01:50:46,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 01:50:46,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:46,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:50:47,085 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 01:50:47,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:50:47,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145132348] [2025-02-08 01:50:47,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145132348] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:50:47,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596486389] [2025-02-08 01:50:47,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:47,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:50:47,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:50:47,091 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:47,092 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:50:51,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 01:50:51,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 01:50:51,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:51,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:50:51,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 4326 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 01:50:51,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:50:51,983 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 01:50:51,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:50:51,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596486389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:50:51,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:50:51,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-08 01:50:51,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539834762] [2025-02-08 01:50:51,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:50:51,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:50:51,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:50:52,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:50:52,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:50:52,004 INFO L87 Difference]: Start difference. First operand has 188 states, 128 states have (on average 1.3046875) internal successors, (167), 134 states have internal predecessors, (167), 35 states have call successors, (35), 18 states have call predecessors, (35), 18 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-08 01:50:52,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:50:52,113 INFO L93 Difference]: Finished difference Result 359 states and 468 transitions. [2025-02-08 01:50:52,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:50:52,115 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 104 [2025-02-08 01:50:52,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:50:52,120 INFO L225 Difference]: With dead ends: 359 [2025-02-08 01:50:52,120 INFO L226 Difference]: Without dead ends: 160 [2025-02-08 01:50:52,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 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:50:52,125 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:50:52,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:50:52,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-08 01:50:52,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-02-08 01:50:52,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 115 states have internal predecessors, (141), 27 states have call successors, (27), 18 states have call predecessors, (27), 17 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-08 01:50:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 194 transitions. [2025-02-08 01:50:52,171 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 194 transitions. Word has length 104 [2025-02-08 01:50:52,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:50:52,176 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 194 transitions. [2025-02-08 01:50:52,176 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-08 01:50:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 194 transitions. [2025-02-08 01:50:52,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-08 01:50:52,178 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:50:52,178 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,193 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:50:52,383 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:50:52,383 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:50:52,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:50:52,385 INFO L85 PathProgramCache]: Analyzing trace with hash 269463683, now seen corresponding path program 1 times [2025-02-08 01:50:52,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:50:52,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212057057] [2025-02-08 01:50:52,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:52,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:50:56,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 01:50:56,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 01:50:56,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:56,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:50:56,940 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 01:50:56,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:50:56,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212057057] [2025-02-08 01:50:56,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212057057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:50:56,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:50:56,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:50:56,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635606189] [2025-02-08 01:50:56,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:50:56,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:50:56,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:50:56,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:50:56,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:50:56,944 INFO L87 Difference]: Start difference. First operand 160 states and 194 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-08 01:50:57,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:50:57,128 INFO L93 Difference]: Finished difference Result 269 states and 315 transitions. [2025-02-08 01:50:57,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:50:57,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 104 [2025-02-08 01:50:57,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:50:57,130 INFO L225 Difference]: With dead ends: 269 [2025-02-08 01:50:57,130 INFO L226 Difference]: Without dead ends: 160 [2025-02-08 01:50:57,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:50:57,131 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 01:50:57,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 369 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 01:50:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-08 01:50:57,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-02-08 01:50:57,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 115 states have (on average 1.2173913043478262) internal successors, (140), 115 states have internal predecessors, (140), 27 states have call successors, (27), 18 states have call predecessors, (27), 17 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-08 01:50:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 193 transitions. [2025-02-08 01:50:57,139 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 193 transitions. Word has length 104 [2025-02-08 01:50:57,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:50:57,139 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 193 transitions. [2025-02-08 01:50:57,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-08 01:50:57,139 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 193 transitions. [2025-02-08 01:50:57,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-08 01:50:57,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:50:57,141 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:50:57,141 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:50:57,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:50:57,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1721404412, now seen corresponding path program 1 times [2025-02-08 01:50:57,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:50:57,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944294893] [2025-02-08 01:50:57,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:57,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:51:00,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-08 01:51:01,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 01:51:01,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:51:01,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:51:01,687 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 01:51:01,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:51:01,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944294893] [2025-02-08 01:51:01,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944294893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:51:01,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:51:01,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:51:01,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193785350] [2025-02-08 01:51:01,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:51:01,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:51:01,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:51:01,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:51:01,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:51:01,688 INFO L87 Difference]: Start difference. First operand 160 states and 193 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-08 01:51:01,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:51:01,966 INFO L93 Difference]: Finished difference Result 247 states and 289 transitions. [2025-02-08 01:51:01,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:51:01,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 106 [2025-02-08 01:51:01,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:51:01,969 INFO L225 Difference]: With dead ends: 247 [2025-02-08 01:51:01,970 INFO L226 Difference]: Without dead ends: 160 [2025-02-08 01:51:01,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:51:01,971 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 01:51:01,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 546 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 01:51:01,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-08 01:51:01,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-02-08 01:51:01,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 115 states have (on average 1.208695652173913) internal successors, (139), 115 states have internal predecessors, (139), 27 states have call successors, (27), 18 states have call predecessors, (27), 17 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-08 01:51:01,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 192 transitions. [2025-02-08 01:51:01,987 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 192 transitions. Word has length 106 [2025-02-08 01:51:01,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:51:01,987 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 192 transitions. [2025-02-08 01:51:01,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-08 01:51:01,987 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 192 transitions. [2025-02-08 01:51:01,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-08 01:51:01,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:51:01,991 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:51:01,992 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:51:01,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:51:01,992 INFO L85 PathProgramCache]: Analyzing trace with hash -816583852, now seen corresponding path program 1 times [2025-02-08 01:51:01,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:51:01,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737902707] [2025-02-08 01:51:01,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:51:01,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:51:05,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-08 01:51:05,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-08 01:51:05,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:51:05,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:51:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 01:51:08,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:51:08,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737902707] [2025-02-08 01:51:08,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737902707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:51:08,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:51:08,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:51:08,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429307835] [2025-02-08 01:51:08,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:51:08,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:51:08,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:51:08,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:51:08,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:51:08,377 INFO L87 Difference]: Start difference. First operand 160 states and 192 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-08 01:51:12,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:51:16,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:51:21,306 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-02-08 01:51:25,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:51:30,082 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-02-08 01:51:33,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:51:33,666 INFO L93 Difference]: Finished difference Result 173 states and 205 transitions. [2025-02-08 01:51:33,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:51:33,672 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 117 [2025-02-08 01:51:33,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:51:33,675 INFO L225 Difference]: With dead ends: 173 [2025-02-08 01:51:33,675 INFO L226 Difference]: Without dead ends: 165 [2025-02-08 01:51:33,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:51:33,676 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 10 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.6s IncrementalHoareTripleChecker+Time [2025-02-08 01:51:33,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1007 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 5 Unknown, 0 Unchecked, 24.6s Time] [2025-02-08 01:51:33,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-08 01:51:33,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2025-02-08 01:51:33,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 117 states have (on average 1.205128205128205) internal successors, (141), 117 states have internal predecessors, (141), 27 states have call successors, (27), 18 states have call predecessors, (27), 17 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-08 01:51:33,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 194 transitions. [2025-02-08 01:51:33,705 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 194 transitions. Word has length 117 [2025-02-08 01:51:33,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:51:33,705 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 194 transitions. [2025-02-08 01:51:33,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-08 01:51:33,706 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 194 transitions. [2025-02-08 01:51:33,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-08 01:51:33,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:51:33,713 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:51:33,714 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:51:33,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:51:33,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1013097357, now seen corresponding path program 1 times [2025-02-08 01:51:33,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:51:33,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563869199] [2025-02-08 01:51:33,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:51:33,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:51:37,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-08 01:51:37,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-08 01:51:37,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:51:37,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:51:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 01:51:38,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:51:38,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563869199] [2025-02-08 01:51:38,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563869199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:51:38,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:51:38,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:51:38,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802426729] [2025-02-08 01:51:38,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:51:38,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:51:38,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:51:38,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:51:38,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:51:38,778 INFO L87 Difference]: Start difference. First operand 162 states and 194 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-08 01:51:39,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:51:39,278 INFO L93 Difference]: Finished difference Result 172 states and 204 transitions. [2025-02-08 01:51:39,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:51:39,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 117 [2025-02-08 01:51:39,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:51:39,280 INFO L225 Difference]: With dead ends: 172 [2025-02-08 01:51:39,280 INFO L226 Difference]: Without dead ends: 160 [2025-02-08 01:51:39,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:51:39,281 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 4 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 01:51:39,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 535 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 01:51:39,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-08 01:51:39,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-02-08 01:51:39,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 115 states have (on average 1.191304347826087) internal successors, (137), 115 states have internal predecessors, (137), 27 states have call successors, (27), 18 states have call predecessors, (27), 17 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-08 01:51:39,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 190 transitions. [2025-02-08 01:51:39,290 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 190 transitions. Word has length 117 [2025-02-08 01:51:39,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:51:39,294 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 190 transitions. [2025-02-08 01:51:39,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-08 01:51:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 190 transitions. [2025-02-08 01:51:39,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-08 01:51:39,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:51:39,299 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:51:39,299 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:51:39,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:51:39,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1367814590, now seen corresponding path program 1 times [2025-02-08 01:51:39,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:51:39,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557142153] [2025-02-08 01:51:39,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:51:39,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:51:42,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 01:51:42,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 01:51:42,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:51:42,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:51:45,309 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 01:51:45,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:51:45,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557142153] [2025-02-08 01:51:45,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557142153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:51:45,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:51:45,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:51:45,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214349713] [2025-02-08 01:51:45,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:51:45,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:51:45,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:51:45,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:51:45,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:51:45,311 INFO L87 Difference]: Start difference. First operand 160 states and 190 transitions. Second operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-08 01:51:49,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:51:53,805 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-02-08 01:51:56,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:51:56,224 INFO L93 Difference]: Finished difference Result 171 states and 200 transitions. [2025-02-08 01:51:56,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:51:56,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 123 [2025-02-08 01:51:56,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:51:56,231 INFO L225 Difference]: With dead ends: 171 [2025-02-08 01:51:56,231 INFO L226 Difference]: Without dead ends: 160 [2025-02-08 01:51:56,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:51:56,232 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 2 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2025-02-08 01:51:56,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1030 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 2 Unknown, 0 Unchecked, 10.9s Time] [2025-02-08 01:51:56,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-08 01:51:56,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-02-08 01:51:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 115 states have (on average 1.182608695652174) internal successors, (136), 115 states have internal predecessors, (136), 27 states have call successors, (27), 18 states have call predecessors, (27), 17 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-08 01:51:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 189 transitions. [2025-02-08 01:51:56,249 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 189 transitions. Word has length 123 [2025-02-08 01:51:56,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:51:56,249 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 189 transitions. [2025-02-08 01:51:56,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-08 01:51:56,249 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 189 transitions. [2025-02-08 01:51:56,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-08 01:51:56,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:51:56,250 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:51:56,250 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:51:56,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:51:56,256 INFO L85 PathProgramCache]: Analyzing trace with hash -380183439, now seen corresponding path program 1 times [2025-02-08 01:51:56,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:51:56,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86802175] [2025-02-08 01:51:56,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:51:56,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:51:59,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-08 01:51:59,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-08 01:51:59,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:51:59,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:04,415 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 01:52:04,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:04,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86802175] [2025-02-08 01:52:04,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86802175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:04,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:04,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 01:52:04,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909899426] [2025-02-08 01:52:04,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:04,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:52:04,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:04,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:52:04,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:52:04,417 INFO L87 Difference]: Start difference. First operand 160 states and 189 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18)