./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 551b0097 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-?-551b009-m [2025-01-09 17:18:39,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 17:18:39,548 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 17:18:39,551 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 17:18:39,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 17:18:39,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 17:18:39,569 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 17:18:39,569 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 17:18:39,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 17:18:39,570 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 17:18:39,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 17:18:39,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 17:18:39,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 17:18:39,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 17:18:39,570 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 17:18:39,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 17:18:39,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 17:18:39,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 17:18:39,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 17:18:39,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 17:18:39,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 17:18:39,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 17:18:39,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 17:18:39,571 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 17:18:39,571 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 17:18:39,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 17:18:39,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:18:39,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:18:39,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:18:39,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:18:39,572 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 17:18:39,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:18:39,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:18:39,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:18:39,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:18:39,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 17:18:39,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 17:18:39,572 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 17:18:39,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 17:18:39,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 17:18:39,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 17:18:39,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 17:18:39,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 17:18:39,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 17:18:39,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 17:18:39,573 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-01-09 17:18:39,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 17:18:39,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 17:18:39,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 17:18:39,813 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 17:18:39,813 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 17:18:39,814 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-01-09 17:18:40,951 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fdd3d5eb7/547ec96e0ee04a9aa695737123d1b1a1/FLAG07c5ad1b8 [2025-01-09 17:18:41,391 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 17:18:41,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i [2025-01-09 17:18:41,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fdd3d5eb7/547ec96e0ee04a9aa695737123d1b1a1/FLAG07c5ad1b8 [2025-01-09 17:18:41,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fdd3d5eb7/547ec96e0ee04a9aa695737123d1b1a1 [2025-01-09 17:18:41,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 17:18:41,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 17:18:41,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 17:18:41,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 17:18:41,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 17:18:41,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:18:41" (1/1) ... [2025-01-09 17:18:41,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eeca2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:41, skipping insertion in model container [2025-01-09 17:18:41,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:18:41" (1/1) ... [2025-01-09 17:18:41,603 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 17:18:41,801 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-01-09 17:18:41,810 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-01-09 17:18:42,337 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:42,338 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:42,338 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:42,339 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:42,339 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:42,348 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:42,348 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:42,349 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:42,350 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:42,351 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:42,351 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:42,352 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:42,352 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:42,948 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:42,950 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:42,981 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:42,983 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:42,991 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:42,992 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,013 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,014 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,015 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,015 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,017 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,018 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,018 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,065 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-01-09 17:18:43,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:18:43,093 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 17:18:43,104 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-01-09 17:18:43,106 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-01-09 17:18:43,134 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,134 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,134 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,135 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,135 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,143 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,144 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,144 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,144 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,146 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,146 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,147 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,147 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,249 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7576-7587] [2025-01-09 17:18:43,304 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,305 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,310 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,311 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,313 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,313 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,318 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,321 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,322 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,322 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,322 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,322 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,322 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:43,334 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-01-09 17:18:43,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:18:43,513 INFO L204 MainTranslator]: Completed translation [2025-01-09 17:18:43,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:43 WrapperNode [2025-01-09 17:18:43,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 17:18:43,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 17:18:43,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 17:18:43,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 17:18:43,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:43" (1/1) ... [2025-01-09 17:18:43,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:43" (1/1) ... [2025-01-09 17:18:43,668 INFO L138 Inliner]: procedures = 764, calls = 2425, calls flagged for inlining = 66, calls inlined = 11, statements flattened = 831 [2025-01-09 17:18:43,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 17:18:43,669 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 17:18:43,669 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 17:18:43,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 17:18:43,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:43" (1/1) ... [2025-01-09 17:18:43,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:43" (1/1) ... [2025-01-09 17:18:43,686 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:43" (1/1) ... [2025-01-09 17:18:43,694 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 17:18:43,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:43" (1/1) ... [2025-01-09 17:18:43,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:43" (1/1) ... [2025-01-09 17:18:43,728 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:43" (1/1) ... [2025-01-09 17:18:43,730 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:43" (1/1) ... [2025-01-09 17:18:43,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:43" (1/1) ... [2025-01-09 17:18:43,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:43" (1/1) ... [2025-01-09 17:18:43,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:43" (1/1) ... [2025-01-09 17:18:43,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 17:18:43,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 17:18:43,762 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 17:18:43,762 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 17:18:43,763 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:43" (1/1) ... [2025-01-09 17:18:43,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:18:43,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:18:43,799 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-01-09 17:18:43,803 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-01-09 17:18:43,817 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2025-01-09 17:18:43,817 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2025-01-09 17:18:43,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 17:18:43,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 17:18:43,817 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-01-09 17:18:43,818 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-01-09 17:18:43,818 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-01-09 17:18:43,818 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-01-09 17:18:43,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 17:18:43,818 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2025-01-09 17:18:43,818 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2025-01-09 17:18:43,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 17:18:43,818 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-01-09 17:18:43,819 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-01-09 17:18:43,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 17:18:43,819 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 17:18:43,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 17:18:43,819 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-01-09 17:18:43,819 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-01-09 17:18:43,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 17:18:43,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 17:18:43,819 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-01-09 17:18:43,819 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-01-09 17:18:43,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 17:18:43,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 17:18:43,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 17:18:43,820 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-01-09 17:18:43,820 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-01-09 17:18:43,820 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-01-09 17:18:43,820 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-01-09 17:18:43,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-01-09 17:18:43,820 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 17:18:43,821 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 17:18:43,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 17:18:43,821 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-01-09 17:18:43,821 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-01-09 17:18:43,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 17:18:43,821 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-01-09 17:18:43,821 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-01-09 17:18:43,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-09 17:18:43,821 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-01-09 17:18:43,821 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-01-09 17:18:43,821 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-01-09 17:18:43,821 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-01-09 17:18:43,821 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-01-09 17:18:43,821 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-01-09 17:18:43,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 17:18:43,822 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2025-01-09 17:18:43,822 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2025-01-09 17:18:43,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 17:18:43,822 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-01-09 17:18:43,822 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-01-09 17:18:44,059 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 17:18:44,060 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 17:18:44,478 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-09 17:18:49,767 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2025-01-09 17:18:49,767 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2025-01-09 17:18:49,917 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2025-01-09 17:18:49,917 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 17:18:49,936 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 17:18:49,936 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 17:18:49,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:18:49 BoogieIcfgContainer [2025-01-09 17:18:49,936 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 17:18:49,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 17:18:49,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 17:18:49,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 17:18:49,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:18:41" (1/3) ... [2025-01-09 17:18:49,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a1b871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:18:49, skipping insertion in model container [2025-01-09 17:18:49,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:43" (2/3) ... [2025-01-09 17:18:49,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a1b871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:18:49, skipping insertion in model container [2025-01-09 17:18:49,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:18:49" (3/3) ... [2025-01-09 17:18:49,953 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_init_unbounded_harness.i [2025-01-09 17:18:49,964 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 17:18:49,967 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_init_unbounded_harness.i that has 19 procedures, 191 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 17:18:50,011 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 17:18:50,022 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;@5d0c87d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 17:18:50,022 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 17:18:50,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 191 states, 137 states have (on average 1.2773722627737227) internal successors, (175), 137 states have internal predecessors, (175), 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-01-09 17:18:50,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 17:18:50,034 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:18:50,034 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] [2025-01-09 17:18:50,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:18:50,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:18:50,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1734843285, now seen corresponding path program 1 times [2025-01-09 17:18:50,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:18:50,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608060112] [2025-01-09 17:18:50,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:18:50,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:18:54,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 17:18:54,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 17:18:54,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:18:54,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:18:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 17:18:55,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:18:55,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608060112] [2025-01-09 17:18:55,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608060112] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:18:55,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341413862] [2025-01-09 17:18:55,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:18:55,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:18:55,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:18:55,157 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-01-09 17:18:55,159 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-01-09 17:18:59,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 17:18:59,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 17:18:59,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:18:59,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:18:59,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 4093 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 17:18:59,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:18:59,661 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 17:18:59,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:18:59,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341413862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:18:59,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:18:59,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 17:18:59,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858955812] [2025-01-09 17:18:59,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:18:59,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 17:18:59,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:18:59,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 17:18:59,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 17:18:59,677 INFO L87 Difference]: Start difference. First operand has 191 states, 137 states have (on average 1.2773722627737227) internal successors, (175), 137 states have internal predecessors, (175), 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 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 17:18:59,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:18:59,699 INFO L93 Difference]: Finished difference Result 371 states and 495 transitions. [2025-01-09 17:18:59,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 17:18:59,700 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 70 [2025-01-09 17:18:59,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:18:59,705 INFO L225 Difference]: With dead ends: 371 [2025-01-09 17:18:59,705 INFO L226 Difference]: Without dead ends: 184 [2025-01-09 17:18:59,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-01-09 17:18:59,713 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:18:59,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:18:59,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-01-09 17:18:59,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-01-09 17:18:59,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 131 states have internal predecessors, (164), 35 states have call successors, (35), 18 states have call predecessors, (35), 18 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 17:18:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 233 transitions. [2025-01-09 17:18:59,744 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 233 transitions. Word has length 70 [2025-01-09 17:18:59,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:18:59,745 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 233 transitions. [2025-01-09 17:18:59,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 17:18:59,745 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 233 transitions. [2025-01-09 17:18:59,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 17:18:59,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:18:59,747 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] [2025-01-09 17:18:59,760 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-01-09 17:18:59,952 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-01-09 17:18:59,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:18:59,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:18:59,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1662150887, now seen corresponding path program 1 times [2025-01-09 17:18:59,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:18:59,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236010444] [2025-01-09 17:18:59,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:18:59,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:19:03,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 17:19:03,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 17:19:03,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:19:03,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:19:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 17:19:04,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:19:04,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236010444] [2025-01-09 17:19:04,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236010444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:19:04,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:19:04,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 17:19:04,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284577917] [2025-01-09 17:19:04,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:19:04,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:19:04,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:19:04,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:19:04,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 17:19:04,288 INFO L87 Difference]: Start difference. First operand 184 states and 233 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 17:19:04,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:19:04,436 INFO L93 Difference]: Finished difference Result 316 states and 390 transitions. [2025-01-09 17:19:04,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:19:04,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 70 [2025-01-09 17:19:04,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:19:04,440 INFO L225 Difference]: With dead ends: 316 [2025-01-09 17:19:04,440 INFO L226 Difference]: Without dead ends: 186 [2025-01-09 17:19:04,441 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-01-09 17:19:04,441 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:19:04,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 688 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:19:04,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-01-09 17:19:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-01-09 17:19:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 132 states have (on average 1.2575757575757576) internal successors, (166), 133 states have internal predecessors, (166), 35 states have call successors, (35), 18 states have call predecessors, (35), 18 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 17:19:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 235 transitions. [2025-01-09 17:19:04,451 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 235 transitions. Word has length 70 [2025-01-09 17:19:04,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:19:04,452 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 235 transitions. [2025-01-09 17:19:04,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 17:19:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 235 transitions. [2025-01-09 17:19:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 17:19:04,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:19:04,453 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] [2025-01-09 17:19:04,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 17:19:04,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:19:04,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:19:04,454 INFO L85 PathProgramCache]: Analyzing trace with hash -475052884, now seen corresponding path program 1 times [2025-01-09 17:19:04,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:19:04,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549591131] [2025-01-09 17:19:04,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:19:04,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:19:08,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 17:19:08,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 17:19:08,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:19:08,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:19:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 17:19:08,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:19:08,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549591131] [2025-01-09 17:19:08,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549591131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:19:08,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:19:08,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 17:19:08,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871958919] [2025-01-09 17:19:08,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:19:08,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:19:08,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:19:08,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:19:08,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 17:19:08,904 INFO L87 Difference]: Start difference. First operand 186 states and 235 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 17:19:09,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:19:09,030 INFO L93 Difference]: Finished difference Result 224 states and 278 transitions. [2025-01-09 17:19:09,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:19:09,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2025-01-09 17:19:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:19:09,032 INFO L225 Difference]: With dead ends: 224 [2025-01-09 17:19:09,033 INFO L226 Difference]: Without dead ends: 190 [2025-01-09 17:19:09,033 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-01-09 17:19:09,033 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:19:09,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 688 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:19:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-01-09 17:19:09,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2025-01-09 17:19:09,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 135 states have (on average 1.2518518518518518) internal successors, (169), 136 states have internal predecessors, (169), 35 states have call successors, (35), 18 states have call predecessors, (35), 19 states have return successors, (35), 35 states have call predecessors, (35), 34 states have call successors, (35) [2025-01-09 17:19:09,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 239 transitions. [2025-01-09 17:19:09,052 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 239 transitions. Word has length 72 [2025-01-09 17:19:09,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:19:09,052 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 239 transitions. [2025-01-09 17:19:09,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 17:19:09,053 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 239 transitions. [2025-01-09 17:19:09,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 17:19:09,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:19:09,058 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] [2025-01-09 17:19:09,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 17:19:09,059 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:19:09,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:19:09,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1439224058, now seen corresponding path program 1 times [2025-01-09 17:19:09,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:19:09,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122198950] [2025-01-09 17:19:09,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:19:09,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:19:12,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 17:19:12,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 17:19:12,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:19:12,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:19:13,255 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 17:19:13,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:19:13,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122198950] [2025-01-09 17:19:13,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122198950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:19:13,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:19:13,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 17:19:13,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119590314] [2025-01-09 17:19:13,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:19:13,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:19:13,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:19:13,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:19:13,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 17:19:13,256 INFO L87 Difference]: Start difference. First operand 190 states and 239 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 17:19:13,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:19:13,359 INFO L93 Difference]: Finished difference Result 224 states and 277 transitions. [2025-01-09 17:19:13,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:19:13,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2025-01-09 17:19:13,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:19:13,361 INFO L225 Difference]: With dead ends: 224 [2025-01-09 17:19:13,361 INFO L226 Difference]: Without dead ends: 190 [2025-01-09 17:19:13,362 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-01-09 17:19:13,362 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 0 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:19:13,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 690 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:19:13,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-01-09 17:19:13,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 186. [2025-01-09 17:19:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 132 states have (on average 1.2424242424242424) internal successors, (164), 133 states have internal predecessors, (164), 35 states have call successors, (35), 18 states have call predecessors, (35), 18 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 17:19:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 233 transitions. [2025-01-09 17:19:13,369 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 233 transitions. Word has length 77 [2025-01-09 17:19:13,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:19:13,370 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 233 transitions. [2025-01-09 17:19:13,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 17:19:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 233 transitions. [2025-01-09 17:19:13,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 17:19:13,372 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:19:13,372 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] [2025-01-09 17:19:13,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 17:19:13,372 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:19:13,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:19:13,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1011536445, now seen corresponding path program 1 times [2025-01-09 17:19:13,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:19:13,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389226608] [2025-01-09 17:19:13,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:19:13,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:19:16,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 17:19:16,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 17:19:16,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:19:16,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:19:17,639 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 17:19:17,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:19:17,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389226608] [2025-01-09 17:19:17,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389226608] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:19:17,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:19:17,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 17:19:17,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793477026] [2025-01-09 17:19:17,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:19:17,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 17:19:17,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:19:17,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 17:19:17,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 17:19:17,641 INFO L87 Difference]: Start difference. First operand 186 states and 233 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-01-09 17:19:17,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:19:17,815 INFO L93 Difference]: Finished difference Result 296 states and 363 transitions. [2025-01-09 17:19:17,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 17:19:17,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 94 [2025-01-09 17:19:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:19:17,819 INFO L225 Difference]: With dead ends: 296 [2025-01-09 17:19:17,820 INFO L226 Difference]: Without dead ends: 191 [2025-01-09 17:19:17,820 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-01-09 17:19:17,820 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:19:17,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 908 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:19:17,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-01-09 17:19:17,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-01-09 17:19:17,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 136 states have (on average 1.2352941176470589) internal successors, (168), 137 states have internal predecessors, (168), 35 states have call successors, (35), 18 states have call predecessors, (35), 19 states have return successors, (37), 35 states have call predecessors, (37), 34 states have call successors, (37) [2025-01-09 17:19:17,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 240 transitions. [2025-01-09 17:19:17,835 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 240 transitions. Word has length 94 [2025-01-09 17:19:17,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:19:17,835 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 240 transitions. [2025-01-09 17:19:17,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-01-09 17:19:17,835 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 240 transitions. [2025-01-09 17:19:17,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 17:19:17,837 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:19:17,837 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] [2025-01-09 17:19:17,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 17:19:17,837 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:19:17,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:19:17,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1521911148, now seen corresponding path program 1 times [2025-01-09 17:19:17,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:19:17,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593924834] [2025-01-09 17:19:17,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:19:17,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:19:21,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 17:19:21,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 17:19:21,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:19:21,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:19:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 17:19:24,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:19:24,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593924834] [2025-01-09 17:19:24,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593924834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:19:24,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:19:24,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 17:19:24,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040251683] [2025-01-09 17:19:24,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:19:24,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 17:19:24,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:19:24,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 17:19:24,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 17:19:24,011 INFO L87 Difference]: Start difference. First operand 191 states and 240 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 17:19:28,064 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-01-09 17:19:32,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 17:19:36,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 17:19:41,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 17:19:45,763 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-01-09 17:19:49,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:19:49,061 INFO L93 Difference]: Finished difference Result 235 states and 292 transitions. [2025-01-09 17:19:49,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 17:19:49,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2025-01-09 17:19:49,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:19:49,066 INFO L225 Difference]: With dead ends: 235 [2025-01-09 17:19:49,067 INFO L226 Difference]: Without dead ends: 199 [2025-01-09 17:19:49,067 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-01-09 17:19:49,067 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 11 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2025-01-09 17:19:49,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1264 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 5 Unknown, 0 Unchecked, 24.4s Time] [2025-01-09 17:19:49,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-01-09 17:19:49,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2025-01-09 17:19:49,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 140 states have (on average 1.2357142857142858) internal successors, (173), 142 states have internal predecessors, (173), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (38), 35 states have call predecessors, (38), 34 states have call successors, (38) [2025-01-09 17:19:49,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 246 transitions. [2025-01-09 17:19:49,080 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 246 transitions. Word has length 100 [2025-01-09 17:19:49,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:19:49,080 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 246 transitions. [2025-01-09 17:19:49,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 17:19:49,080 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 246 transitions. [2025-01-09 17:19:49,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 17:19:49,081 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:19:49,081 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] [2025-01-09 17:19:49,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 17:19:49,082 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:19:49,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:19:49,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1128884138, now seen corresponding path program 1 times [2025-01-09 17:19:49,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:19:49,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283652068] [2025-01-09 17:19:49,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:19:49,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:19:52,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 17:19:52,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 17:19:52,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:19:52,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:19:53,598 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 17:19:53,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:19:53,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283652068] [2025-01-09 17:19:53,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283652068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:19:53,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:19:53,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 17:19:53,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222997944] [2025-01-09 17:19:53,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:19:53,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 17:19:53,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:19:53,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 17:19:53,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 17:19:53,599 INFO L87 Difference]: Start difference. First operand 196 states and 246 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 17:19:53,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:19:53,837 INFO L93 Difference]: Finished difference Result 242 states and 300 transitions. [2025-01-09 17:19:53,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 17:19:53,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2025-01-09 17:19:53,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:19:53,841 INFO L225 Difference]: With dead ends: 242 [2025-01-09 17:19:53,841 INFO L226 Difference]: Without dead ends: 201 [2025-01-09 17:19:53,841 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-01-09 17:19:53,842 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 5 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:19:53,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 677 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:19:53,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-01-09 17:19:53,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2025-01-09 17:19:53,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 141 states have (on average 1.2340425531914894) internal successors, (174), 143 states have internal predecessors, (174), 36 states have call successors, (36), 18 states have call predecessors, (36), 20 states have return successors, (39), 36 states have call predecessors, (39), 35 states have call successors, (39) [2025-01-09 17:19:53,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 249 transitions. [2025-01-09 17:19:53,850 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 249 transitions. Word has length 100 [2025-01-09 17:19:53,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:19:53,850 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 249 transitions. [2025-01-09 17:19:53,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 17:19:53,850 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2025-01-09 17:19:53,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 17:19:53,851 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:19:53,851 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-01-09 17:19:53,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 17:19:53,851 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:19:53,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:19:53,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1119241339, now seen corresponding path program 1 times [2025-01-09 17:19:53,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:19:53,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702453722] [2025-01-09 17:19:53,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:19:53,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:19:57,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 17:19:57,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 17:19:57,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:19:57,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:01,341 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 17:20:01,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:01,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702453722] [2025-01-09 17:20:01,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702453722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:01,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:01,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 17:20:01,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158565126] [2025-01-09 17:20:01,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:01,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 17:20:01,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:01,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 17:20:01,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:20:01,342 INFO L87 Difference]: Start difference. First operand 198 states and 249 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 17:20:05,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 17:20:09,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 17:20:14,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers []