./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c061a12cbc38eba33828b4010e38aa9d2f9e1471733e9a6b829e0f771d8d2fcd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 07:14:20,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 07:14:20,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 07:14:20,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 07:14:20,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 07:14:20,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 07:14:20,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 07:14:20,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 07:14:20,715 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 07:14:20,715 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 07:14:20,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 07:14:20,715 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 07:14:20,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 07:14:20,716 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 07:14:20,716 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 07:14:20,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 07:14:20,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 07:14:20,716 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 07:14:20,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 07:14:20,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 07:14:20,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 07:14:20,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 07:14:20,717 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 07:14:20,717 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 07:14:20,717 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 07:14:20,717 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 07:14:20,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 07:14:20,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 07:14:20,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 07:14:20,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 07:14:20,718 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 07:14:20,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 07:14:20,718 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 07:14:20,718 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 07:14:20,719 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 07:14:20,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 07:14:20,719 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 07:14:20,719 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 07:14:20,719 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 07:14:20,719 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 07:14:20,719 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c061a12cbc38eba33828b4010e38aa9d2f9e1471733e9a6b829e0f771d8d2fcd [2025-03-17 07:14:20,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 07:14:20,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 07:14:20,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 07:14:20,982 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 07:14:20,982 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 07:14:20,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i [2025-03-17 07:14:22,330 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a44f000/e46902dbe35843949da3a7a72c74bdc7/FLAG4f6d55f69 [2025-03-17 07:14:22,832 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 07:14:22,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i [2025-03-17 07:14:22,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a44f000/e46902dbe35843949da3a7a72c74bdc7/FLAG4f6d55f69 [2025-03-17 07:14:23,389 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a44f000/e46902dbe35843949da3a7a72c74bdc7 [2025-03-17 07:14:23,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 07:14:23,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 07:14:23,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 07:14:23,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 07:14:23,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 07:14:23,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:14:23" (1/1) ... [2025-03-17 07:14:23,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762996bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:23, skipping insertion in model container [2025-03-17 07:14:23,400 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:14:23" (1/1) ... [2025-03-17 07:14:23,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 07:14:23,745 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i[4503,4516] [2025-03-17 07:14:23,754 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i[4563,4576] [2025-03-17 07:14:24,360 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:24,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:24,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:24,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:24,362 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:24,371 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:24,371 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:24,372 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:24,372 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:24,373 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:24,374 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:24,374 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:24,375 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,152 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,153 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,172 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,172 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,179 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,181 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,196 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,197 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,198 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,198 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,199 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,199 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,199 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,230 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i[227916,227929] [2025-03-17 07:14:25,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 07:14:25,300 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 07:14:25,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i[4503,4516] [2025-03-17 07:14:25,329 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i[4563,4576] [2025-03-17 07:14:25,360 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,363 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,363 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,363 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,364 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,368 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,369 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,370 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,370 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,371 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,372 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,372 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,372 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,434 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7576-7587] [2025-03-17 07:14:25,511 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,511 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,561 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,561 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,564 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,564 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,569 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,570 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,570 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,570 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,572 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,573 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,573 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:25,587 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i[227916,227929] [2025-03-17 07:14:25,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 07:14:25,761 INFO L204 MainTranslator]: Completed translation [2025-03-17 07:14:25,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:25 WrapperNode [2025-03-17 07:14:25,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 07:14:25,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 07:14:25,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 07:14:25,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 07:14:25,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:25" (1/1) ... [2025-03-17 07:14:25,898 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:25" (1/1) ... [2025-03-17 07:14:25,952 INFO L138 Inliner]: procedures = 764, calls = 2425, calls flagged for inlining = 66, calls inlined = 11, statements flattened = 831 [2025-03-17 07:14:25,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 07:14:25,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 07:14:25,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 07:14:25,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 07:14:25,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:25" (1/1) ... [2025-03-17 07:14:25,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:25" (1/1) ... [2025-03-17 07:14:25,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:25" (1/1) ... [2025-03-17 07:14:26,072 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 07:14:26,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:25" (1/1) ... [2025-03-17 07:14:26,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:25" (1/1) ... [2025-03-17 07:14:26,101 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:25" (1/1) ... [2025-03-17 07:14:26,103 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:25" (1/1) ... [2025-03-17 07:14:26,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:25" (1/1) ... [2025-03-17 07:14:26,117 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:25" (1/1) ... [2025-03-17 07:14:26,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 07:14:26,125 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 07:14:26,125 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 07:14:26,125 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 07:14:26,129 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:25" (1/1) ... [2025-03-17 07:14:26,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 07:14:26,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:14:26,157 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 07:14:26,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 07:14:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2025-03-17 07:14:26,178 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2025-03-17 07:14:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 07:14:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 07:14:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-03-17 07:14:26,178 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-03-17 07:14:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-03-17 07:14:26,178 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-03-17 07:14:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 07:14:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2025-03-17 07:14:26,178 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2025-03-17 07:14:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 07:14:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-17 07:14:26,178 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-17 07:14:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 07:14:26,178 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 07:14:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 07:14:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-03-17 07:14:26,178 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-03-17 07:14:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 07:14:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 07:14:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-03-17 07:14:26,178 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-03-17 07:14:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 07:14:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 07:14:26,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 07:14:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-03-17 07:14:26,179 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-03-17 07:14:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-17 07:14:26,179 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-17 07:14:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-17 07:14:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 07:14:26,179 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 07:14:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 07:14:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-03-17 07:14:26,179 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-03-17 07:14:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 07:14:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-03-17 07:14:26,179 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-03-17 07:14:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-17 07:14:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-03-17 07:14:26,179 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-03-17 07:14:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-17 07:14:26,179 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-17 07:14:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-03-17 07:14:26,179 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-03-17 07:14:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 07:14:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2025-03-17 07:14:26,179 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2025-03-17 07:14:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 07:14:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-03-17 07:14:26,179 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-03-17 07:14:26,441 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 07:14:26,443 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 07:14:26,500 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10008: havoc #t~mem1491.base, #t~mem1491.offset;havoc #t~short1492;havoc #t~mem1493.base, #t~mem1493.offset;havoc #t~ret1494;havoc #t~short1495; [2025-03-17 07:14:26,511 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-03-17 07:14:26,542 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10121: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-03-17 07:14:26,592 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6940: havoc bounded_calloc_#t~malloc587#1.base, bounded_calloc_#t~malloc587#1.offset;call ULTIMATE.dealloc(bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset);havoc bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset; [2025-03-17 07:14:26,592 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6955: havoc #t~ret589#1;havoc #t~ite591#1.base, #t~ite591#1.offset;havoc #t~ret590#1.base, #t~ret590#1.offset; [2025-03-17 07:14:26,772 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: havoc aws_round_up_to_power_of_two_#t~ret62#1; [2025-03-17 07:14:26,772 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9201: call ULTIMATE.dealloc(~#size~0#1.base, ~#size~0#1.offset);havoc ~#size~0#1.base, ~#size~0#1.offset; [2025-03-17 07:14:26,780 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6986: havoc #t~ret600.base, #t~ret600.offset; [2025-03-17 07:14:26,781 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc #t~nondet6; [2025-03-17 07:14:26,799 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-03-17 07:14:27,021 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7009: call ULTIMATE.dealloc(aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset);havoc aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset; [2025-03-17 07:14:27,021 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9172: call ULTIMATE.dealloc(~#required_bytes~3#1.base, ~#required_bytes~3#1.offset);havoc ~#required_bytes~3#1.base, ~#required_bytes~3#1.offset; [2025-03-17 07:14:27,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-03-17 07:14:27,055 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-03-17 07:14:32,093 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9260-1: assume false; [2025-03-17 07:14:32,093 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9260-1: assume !false; [2025-03-17 07:14:32,191 INFO L? ?]: Removed 167 outVars from TransFormulas that were not future-live. [2025-03-17 07:14:32,192 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 07:14:32,214 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 07:14:32,216 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 07:14:32,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:14:32 BoogieIcfgContainer [2025-03-17 07:14:32,216 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 07:14:32,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 07:14:32,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 07:14:32,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 07:14:32,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:14:23" (1/3) ... [2025-03-17 07:14:32,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15fc0d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:14:32, skipping insertion in model container [2025-03-17 07:14:32,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:25" (2/3) ... [2025-03-17 07:14:32,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15fc0d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:14:32, skipping insertion in model container [2025-03-17 07:14:32,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:14:32" (3/3) ... [2025-03-17 07:14:32,224 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_init_unbounded_harness.i [2025-03-17 07:14:32,236 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 07:14:32,239 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_init_unbounded_harness.i that has 19 procedures, 187 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 07:14:32,289 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 07:14:32,298 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;@3fa293e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 07:14:32,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 07:14:32,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 133 states have (on average 1.2857142857142858) internal successors, (171), 133 states have internal predecessors, (171), 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-03-17 07:14:32,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 07:14:32,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:14:32,312 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] [2025-03-17 07:14:32,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:14:32,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:14:32,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1042170061, now seen corresponding path program 1 times [2025-03-17 07:14:32,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:14:32,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281254637] [2025-03-17 07:14:32,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:14:32,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:14:37,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 07:14:37,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 07:14:37,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:14:37,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:14:38,020 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-17 07:14:38,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:14:38,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281254637] [2025-03-17 07:14:38,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281254637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:14:38,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315615863] [2025-03-17 07:14:38,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:14:38,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:14:38,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:14:38,024 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 07:14:38,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 07:14:42,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 07:14:42,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 07:14:42,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:14:42,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:14:43,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 4092 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 07:14:43,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:14:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-17 07:14:43,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:14:43,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315615863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:14:43,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:14:43,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 07:14:43,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778767271] [2025-03-17 07:14:43,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:14:43,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 07:14:43,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:14:43,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 07:14:43,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 07:14:43,100 INFO L87 Difference]: Start difference. First operand has 187 states, 133 states have (on average 1.2857142857142858) internal successors, (171), 133 states have internal predecessors, (171), 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 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-03-17 07:14:43,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:14:43,487 INFO L93 Difference]: Finished difference Result 364 states and 488 transitions. [2025-03-17 07:14:43,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 07:14:43,497 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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 69 [2025-03-17 07:14:43,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:14:43,554 INFO L225 Difference]: With dead ends: 364 [2025-03-17 07:14:43,554 INFO L226 Difference]: Without dead ends: 182 [2025-03-17 07:14:43,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 07:14:43,563 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 07:14:43,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 07:14:43,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-17 07:14:43,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-03-17 07:14:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 128 states have (on average 1.265625) internal successors, (162), 129 states have internal predecessors, (162), 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-03-17 07:14:43,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 231 transitions. [2025-03-17 07:14:43,627 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 231 transitions. Word has length 69 [2025-03-17 07:14:43,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:14:43,628 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 231 transitions. [2025-03-17 07:14:43,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-03-17 07:14:43,628 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 231 transitions. [2025-03-17 07:14:43,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 07:14:43,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:14:43,632 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] [2025-03-17 07:14:43,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 07:14:43,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 07:14:43,833 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:14:43,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:14:43,833 INFO L85 PathProgramCache]: Analyzing trace with hash 593183499, now seen corresponding path program 1 times [2025-03-17 07:14:43,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:14:43,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247028082] [2025-03-17 07:14:43,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:14:43,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:14:47,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 07:14:47,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 07:14:47,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:14:47,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:14:48,661 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 07:14:48,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:14:48,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247028082] [2025-03-17 07:14:48,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247028082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:14:48,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:14:48,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 07:14:48,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384501602] [2025-03-17 07:14:48,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:14:48,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 07:14:48,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:14:48,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 07:14:48,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:14:48,666 INFO L87 Difference]: Start difference. First operand 182 states and 231 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-03-17 07:14:49,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:14:49,008 INFO L93 Difference]: Finished difference Result 312 states and 386 transitions. [2025-03-17 07:14:49,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 07:14:49,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 69 [2025-03-17 07:14:49,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:14:49,011 INFO L225 Difference]: With dead ends: 312 [2025-03-17 07:14:49,011 INFO L226 Difference]: Without dead ends: 184 [2025-03-17 07:14:49,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:14:49,013 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 0 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 07:14:49,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 661 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 07:14:49,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-17 07:14:49,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-03-17 07:14:49,022 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-03-17 07:14:49,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 233 transitions. [2025-03-17 07:14:49,024 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 233 transitions. Word has length 69 [2025-03-17 07:14:49,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:14:49,024 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 233 transitions. [2025-03-17 07:14:49,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-03-17 07:14:49,024 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 233 transitions. [2025-03-17 07:14:49,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 07:14:49,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:14:49,026 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] [2025-03-17 07:14:49,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 07:14:49,026 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:14:49,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:14:49,027 INFO L85 PathProgramCache]: Analyzing trace with hash 171349579, now seen corresponding path program 1 times [2025-03-17 07:14:49,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:14:49,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229375928] [2025-03-17 07:14:49,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:14:49,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:14:53,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 07:14:53,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 07:14:53,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:14:53,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:14:53,964 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 07:14:53,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:14:53,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229375928] [2025-03-17 07:14:53,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229375928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:14:53,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:14:53,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 07:14:53,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079162890] [2025-03-17 07:14:53,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:14:53,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 07:14:53,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:14:53,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 07:14:53,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:14:53,967 INFO L87 Difference]: Start difference. First operand 184 states and 233 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-03-17 07:14:54,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:14:54,302 INFO L93 Difference]: Finished difference Result 222 states and 276 transitions. [2025-03-17 07:14:54,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 07:14:54,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 71 [2025-03-17 07:14:54,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:14:54,305 INFO L225 Difference]: With dead ends: 222 [2025-03-17 07:14:54,305 INFO L226 Difference]: Without dead ends: 188 [2025-03-17 07:14:54,305 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-03-17 07:14:54,306 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 0 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 07:14:54,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 661 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 07:14:54,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-17 07:14:54,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-03-17 07:14:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 133 states have (on average 1.255639097744361) internal successors, (167), 134 states have internal predecessors, (167), 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-03-17 07:14:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 237 transitions. [2025-03-17 07:14:54,316 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 237 transitions. Word has length 71 [2025-03-17 07:14:54,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:14:54,316 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 237 transitions. [2025-03-17 07:14:54,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-03-17 07:14:54,316 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 237 transitions. [2025-03-17 07:14:54,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 07:14:54,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:14:54,318 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] [2025-03-17 07:14:54,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 07:14:54,318 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:14:54,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:14:54,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1869993962, now seen corresponding path program 1 times [2025-03-17 07:14:54,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:14:54,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268464931] [2025-03-17 07:14:54,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:14:54,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:14:58,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 07:14:58,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 07:14:58,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:14:58,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:14:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 07:14:58,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:14:58,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268464931] [2025-03-17 07:14:58,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268464931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:14:58,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:14:58,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 07:14:58,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272757039] [2025-03-17 07:14:58,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:14:58,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 07:14:58,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:14:58,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 07:14:58,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:14:58,954 INFO L87 Difference]: Start difference. First operand 188 states and 237 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-03-17 07:15:03,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 07:15:03,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:15:03,861 INFO L93 Difference]: Finished difference Result 222 states and 275 transitions. [2025-03-17 07:15:03,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 07:15:03,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 75 [2025-03-17 07:15:03,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:15:03,863 INFO L225 Difference]: With dead ends: 222 [2025-03-17 07:15:03,863 INFO L226 Difference]: Without dead ends: 188 [2025-03-17 07:15:03,865 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-03-17 07:15:03,865 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 0 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-17 07:15:03,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 663 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2025-03-17 07:15:03,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-17 07:15:03,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2025-03-17 07:15:03,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 130 states have (on average 1.2461538461538462) internal successors, (162), 131 states have internal predecessors, (162), 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-03-17 07:15:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 231 transitions. [2025-03-17 07:15:03,874 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 231 transitions. Word has length 75 [2025-03-17 07:15:03,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:15:03,875 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 231 transitions. [2025-03-17 07:15:03,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-03-17 07:15:03,875 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 231 transitions. [2025-03-17 07:15:03,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 07:15:03,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:15:03,876 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] [2025-03-17 07:15:03,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 07:15:03,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:15:03,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:15:03,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1432976325, now seen corresponding path program 1 times [2025-03-17 07:15:03,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:15:03,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018574679] [2025-03-17 07:15:03,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:03,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:15:07,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 07:15:07,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 07:15:07,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:07,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:08,924 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 07:15:08,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:15:08,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018574679] [2025-03-17 07:15:08,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018574679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:15:08,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:15:08,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 07:15:08,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334971949] [2025-03-17 07:15:08,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:15:08,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 07:15:08,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:15:08,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 07:15:08,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 07:15:08,925 INFO L87 Difference]: Start difference. First operand 184 states and 231 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-03-17 07:15:09,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:15:09,475 INFO L93 Difference]: Finished difference Result 292 states and 359 transitions. [2025-03-17 07:15:09,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 07:15:09,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 93 [2025-03-17 07:15:09,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:15:09,481 INFO L225 Difference]: With dead ends: 292 [2025-03-17 07:15:09,481 INFO L226 Difference]: Without dead ends: 189 [2025-03-17 07:15:09,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 07:15:09,485 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 07:15:09,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 872 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 07:15:09,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-17 07:15:09,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-03-17 07:15:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 134 states have (on average 1.2388059701492538) internal successors, (166), 135 states have internal predecessors, (166), 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-03-17 07:15:09,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 238 transitions. [2025-03-17 07:15:09,504 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 238 transitions. Word has length 93 [2025-03-17 07:15:09,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:15:09,504 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 238 transitions. [2025-03-17 07:15:09,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-03-17 07:15:09,505 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 238 transitions. [2025-03-17 07:15:09,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 07:15:09,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:15:09,506 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] [2025-03-17 07:15:09,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 07:15:09,511 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:15:09,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:15:09,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1779121018, now seen corresponding path program 1 times [2025-03-17 07:15:09,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:15:09,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026844750] [2025-03-17 07:15:09,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:09,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:15:13,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 07:15:13,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 07:15:13,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:13,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:17,336 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 07:15:17,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:15:17,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026844750] [2025-03-17 07:15:17,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026844750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:15:17,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:15:17,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 07:15:17,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5728493] [2025-03-17 07:15:17,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:15:17,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 07:15:17,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:15:17,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 07:15:17,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 07:15:17,340 INFO L87 Difference]: Start difference. First operand 189 states and 238 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 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-03-17 07:15:21,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 07:15:25,781 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-03-17 07:15:30,299 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 [] [2025-03-17 07:15:34,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 07:15:39,107 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-03-17 07:15:43,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:15:43,363 INFO L93 Difference]: Finished difference Result 233 states and 290 transitions. [2025-03-17 07:15:43,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 07:15:43,372 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 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 98 [2025-03-17 07:15:43,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:15:43,377 INFO L225 Difference]: With dead ends: 233 [2025-03-17 07:15:43,377 INFO L226 Difference]: Without dead ends: 197 [2025-03-17 07:15:43,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-17 07:15:43,378 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 11 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.3s IncrementalHoareTripleChecker+Time [2025-03-17 07:15:43,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1210 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 5 Unknown, 0 Unchecked, 25.3s Time] [2025-03-17 07:15:43,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-17 07:15:43,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2025-03-17 07:15:43,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 140 states have internal predecessors, (171), 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-03-17 07:15:43,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 244 transitions. [2025-03-17 07:15:43,407 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 244 transitions. Word has length 98 [2025-03-17 07:15:43,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:15:43,407 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 244 transitions. [2025-03-17 07:15:43,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 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-03-17 07:15:43,407 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 244 transitions. [2025-03-17 07:15:43,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 07:15:43,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:15:43,411 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] [2025-03-17 07:15:43,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 07:15:43,411 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:15:43,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:15:43,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1975634523, now seen corresponding path program 1 times [2025-03-17 07:15:43,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:15:43,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663210336] [2025-03-17 07:15:43,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:43,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:15:47,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 07:15:47,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 07:15:47,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:47,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 07:15:48,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:15:48,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663210336] [2025-03-17 07:15:48,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663210336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:15:48,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:15:48,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 07:15:48,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866877025] [2025-03-17 07:15:48,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:15:48,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 07:15:48,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:15:48,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 07:15:48,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 07:15:48,654 INFO L87 Difference]: Start difference. First operand 194 states and 244 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-03-17 07:15:49,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:15:49,419 INFO L93 Difference]: Finished difference Result 240 states and 298 transitions. [2025-03-17 07:15:49,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 07:15:49,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 98 [2025-03-17 07:15:49,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:15:49,421 INFO L225 Difference]: With dead ends: 240 [2025-03-17 07:15:49,421 INFO L226 Difference]: Without dead ends: 199 [2025-03-17 07:15:49,421 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-03-17 07:15:49,422 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 3 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 07:15:49,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 871 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 07:15:49,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-17 07:15:49,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2025-03-17 07:15:49,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 139 states have (on average 1.2374100719424461) internal successors, (172), 141 states have internal predecessors, (172), 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-03-17 07:15:49,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 247 transitions. [2025-03-17 07:15:49,429 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 247 transitions. Word has length 98 [2025-03-17 07:15:49,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:15:49,430 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 247 transitions. [2025-03-17 07:15:49,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-03-17 07:15:49,430 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 247 transitions. [2025-03-17 07:15:49,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 07:15:49,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:15:49,431 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:15:49,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 07:15:49,431 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:15:49,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:15:49,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1845236601, now seen corresponding path program 1 times [2025-03-17 07:15:49,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:15:49,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426998154] [2025-03-17 07:15:49,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:49,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:15:53,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 07:15:53,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 07:15:53,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:53,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 07:15:55,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:15:55,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426998154] [2025-03-17 07:15:55,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426998154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:15:55,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:15:55,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 07:15:55,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245279074] [2025-03-17 07:15:55,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:15:55,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 07:15:55,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:15:55,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 07:15:55,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 07:15:55,486 INFO L87 Difference]: Start difference. First operand 196 states and 247 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16)