./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness_negated.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ace14697ac0820cd1cdf4cf69cd00f22476365c493527983be1f9a153e0d5b6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:50:20,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:50:21,043 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 01:50:21,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:50:21,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:50:21,060 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:50:21,061 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:50:21,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:50:21,061 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:50:21,061 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:50:21,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:50:21,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:50:21,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:50:21,061 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:50:21,062 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:50:21,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:50:21,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:50:21,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:50:21,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:50:21,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:50:21,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:50:21,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:50:21,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:50:21,063 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:50:21,063 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:50:21,063 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:50:21,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:50:21,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:50:21,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:50:21,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:50:21,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:50:21,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:50:21,064 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:50:21,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:50:21,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:50:21,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:50:21,064 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:50:21,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:50:21,064 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:50:21,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:50:21,065 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ace14697ac0820cd1cdf4cf69cd00f22476365c493527983be1f9a153e0d5b6f [2025-02-08 01:50:21,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:50:21,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:50:21,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:50:21,299 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:50:21,299 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:50:21,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness_negated.i [2025-02-08 01:50:22,477 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f8ee9146/1520a0e774c547bd8dbf815534d1d4ad/FLAGc1b2dc6a2 [2025-02-08 01:50:23,003 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:50:23,003 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness_negated.i [2025-02-08 01:50:23,039 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f8ee9146/1520a0e774c547bd8dbf815534d1d4ad/FLAGc1b2dc6a2 [2025-02-08 01:50:23,051 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f8ee9146/1520a0e774c547bd8dbf815534d1d4ad [2025-02-08 01:50:23,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:50:23,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:50:23,056 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:50:23,056 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:50:23,063 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:50:23,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:50:23" (1/1) ... [2025-02-08 01:50:23,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a652ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:23, skipping insertion in model container [2025-02-08 01:50:23,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:50:23" (1/1) ... [2025-02-08 01:50:23,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:50:23,403 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness_negated.i[4501,4514] [2025-02-08 01:50:23,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness_negated.i[4561,4574] [2025-02-08 01:50:24,379 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:24,380 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:24,380 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:24,380 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:24,381 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:24,389 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:24,390 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:24,391 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:24,391 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:24,393 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:24,393 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:24,394 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:24,394 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,598 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,598 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,626 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,627 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,633 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,633 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,647 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,648 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,648 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,649 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,649 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,649 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,649 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,677 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness_negated.i[228071,228084] [2025-02-08 01:50:25,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:50:25,705 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:50:25,715 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness_negated.i[4501,4514] [2025-02-08 01:50:25,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness_negated.i[4561,4574] [2025-02-08 01:50:25,757 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,758 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,758 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,758 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,758 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,763 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,765 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,766 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,767 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,768 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,768 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,768 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,769 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,837 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7526-7537] [2025-02-08 01:50:25,955 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,956 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,960 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,961 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,962 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,963 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,967 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,968 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,968 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,968 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,968 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,968 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,968 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:25,982 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness_negated.i[228071,228084] [2025-02-08 01:50:25,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:50:26,119 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:50:26,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:26 WrapperNode [2025-02-08 01:50:26,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:50:26,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:50:26,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:50:26,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:50:26,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:26" (1/1) ... [2025-02-08 01:50:26,182 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:26" (1/1) ... [2025-02-08 01:50:26,229 INFO L138 Inliner]: procedures = 763, calls = 2426, calls flagged for inlining = 67, calls inlined = 13, statements flattened = 854 [2025-02-08 01:50:26,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:50:26,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:50:26,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:50:26,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:50:26,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:26" (1/1) ... [2025-02-08 01:50:26,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:26" (1/1) ... [2025-02-08 01:50:26,245 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:26" (1/1) ... [2025-02-08 01:50:26,252 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 01:50:26,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:26" (1/1) ... [2025-02-08 01:50:26,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:26" (1/1) ... [2025-02-08 01:50:26,286 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:26" (1/1) ... [2025-02-08 01:50:26,293 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:26" (1/1) ... [2025-02-08 01:50:26,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:26" (1/1) ... [2025-02-08 01:50:26,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:26" (1/1) ... [2025-02-08 01:50:26,312 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:50:26,313 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:50:26,313 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:50:26,313 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:50:26,314 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:26" (1/1) ... [2025-02-08 01:50:26,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:50:26,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:50:26,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:50:26,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:50:26,363 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2025-02-08 01:50:26,364 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2025-02-08 01:50:26,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-08 01:50:26,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 01:50:26,364 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-02-08 01:50:26,364 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-02-08 01:50:26,364 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-02-08 01:50:26,364 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-02-08 01:50:26,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 01:50:26,364 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2025-02-08 01:50:26,365 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2025-02-08 01:50:26,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 01:50:26,365 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-02-08 01:50:26,365 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-02-08 01:50:26,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 01:50:26,365 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 01:50:26,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-08 01:50:26,365 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-02-08 01:50:26,365 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-02-08 01:50:26,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:50:26,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:50:26,365 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-02-08 01:50:26,365 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-02-08 01:50:26,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 01:50:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:50:26,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:50:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-02-08 01:50:26,366 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-02-08 01:50:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-02-08 01:50:26,366 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-02-08 01:50:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 01:50:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 01:50:26,366 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 01:50:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 01:50:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-02-08 01:50:26,366 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-02-08 01:50:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 01:50:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-02-08 01:50:26,367 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-02-08 01:50:26,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 01:50:26,367 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-02-08 01:50:26,367 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-02-08 01:50:26,367 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-02-08 01:50:26,367 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-02-08 01:50:26,367 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-02-08 01:50:26,367 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-02-08 01:50:26,367 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-02-08 01:50:26,367 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-02-08 01:50:26,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 01:50:26,367 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2025-02-08 01:50:26,367 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2025-02-08 01:50:26,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 01:50:26,367 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-02-08 01:50:26,367 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-02-08 01:50:26,644 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:50:26,645 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:50:26,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9956: havoc #t~mem1489.base, #t~mem1489.offset;havoc #t~short1490;havoc #t~mem1491.base, #t~mem1491.offset;havoc #t~ret1492;havoc #t~short1493; [2025-02-08 01:50:26,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-02-08 01:50:26,762 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L10069: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-02-08 01:50:26,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6943: havoc #t~ret589#1;havoc #t~ite591#1.base, #t~ite591#1.offset;havoc #t~ret590#1.base, #t~ret590#1.offset; [2025-02-08 01:50:26,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6928: havoc bounded_calloc_#t~malloc587#1.base, bounded_calloc_#t~malloc587#1.offset;call ULTIMATE.dealloc(bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset);havoc bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset;#t~ret590#1.base, #t~ret590#1.offset := bounded_calloc_#res#1.base, bounded_calloc_#res#1.offset;havoc bounded_calloc_#t~ret585#1, bounded_calloc_#t~mem586#1, bounded_calloc_#t~malloc587#1.base, bounded_calloc_#t~malloc587#1.offset, bounded_calloc_~num#1, bounded_calloc_~size#1, bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset;havoc bounded_calloc_#in~num#1, bounded_calloc_#in~size#1;assume { :end_inline_bounded_calloc } true;#t~ite591#1.base, #t~ite591#1.offset := #t~ret590#1.base, #t~ret590#1.offset; [2025-02-08 01:50:26,921 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: havoc aws_round_up_to_power_of_two_#t~ret62#1; [2025-02-08 01:50:26,921 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9151: call ULTIMATE.dealloc(~#size~0#1.base, ~#size~0#1.offset);havoc ~#size~0#1.base, ~#size~0#1.offset; [2025-02-08 01:50:26,929 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6974: havoc #t~ret600.base, #t~ret600.offset; [2025-02-08 01:50:26,931 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc #t~nondet6; [2025-02-08 01:50:26,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-02-08 01:50:26,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-02-08 01:50:27,188 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6997: call ULTIMATE.dealloc(aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset);havoc aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset; [2025-02-08 01:50:27,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9122: call ULTIMATE.dealloc(~#required_bytes~3#1.base, ~#required_bytes~3#1.offset);havoc ~#required_bytes~3#1.base, ~#required_bytes~3#1.offset; [2025-02-08 01:50:27,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-02-08 01:50:27,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-02-08 01:50:32,821 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9210-1: assume false; [2025-02-08 01:50:32,821 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9210-1: assume !false; [2025-02-08 01:50:32,915 INFO L? ?]: Removed 181 outVars from TransFormulas that were not future-live. [2025-02-08 01:50:32,915 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:50:32,936 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:50:32,936 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:50:32,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:50:32 BoogieIcfgContainer [2025-02-08 01:50:32,937 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:50:32,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:50:32,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:50:32,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:50:32,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:50:23" (1/3) ... [2025-02-08 01:50:32,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f1d615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:50:32, skipping insertion in model container [2025-02-08 01:50:32,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:26" (2/3) ... [2025-02-08 01:50:32,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f1d615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:50:32, skipping insertion in model container [2025-02-08 01:50:32,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:50:32" (3/3) ... [2025-02-08 01:50:32,948 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_init_bounded_harness_negated.i [2025-02-08 01:50:32,959 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:50:32,960 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_init_bounded_harness_negated.i that has 20 procedures, 201 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 01:50:33,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:50:33,015 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;@3194585f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:50:33,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 01:50:33,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 136 states have (on average 1.2941176470588236) internal successors, (176), 142 states have internal predecessors, (176), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-08 01:50:33,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-08 01:50:33,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:50:33,031 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:50:33,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:50:33,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:50:33,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1757987406, now seen corresponding path program 1 times [2025-02-08 01:50:33,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:50:33,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503609239] [2025-02-08 01:50:33,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:33,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:50:37,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 01:50:37,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 01:50:37,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:37,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:50:38,141 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-08 01:50:38,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:50:38,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503609239] [2025-02-08 01:50:38,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503609239] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:50:38,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829876380] [2025-02-08 01:50:38,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:38,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:50:38,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:50:38,150 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:50:38,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 01:50:42,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 01:50:42,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 01:50:42,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:42,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:50:42,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 4336 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 01:50:42,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:50:42,867 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-08 01:50:42,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:50:42,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829876380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:50:42,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:50:42,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-08 01:50:42,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128049740] [2025-02-08 01:50:42,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:50:42,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:50:42,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:50:42,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:50:42,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:50:42,887 INFO L87 Difference]: Start difference. First operand has 201 states, 136 states have (on average 1.2941176470588236) internal successors, (176), 142 states have internal predecessors, (176), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 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-02-08 01:50:42,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:50:42,990 INFO L93 Difference]: Finished difference Result 374 states and 489 transitions. [2025-02-08 01:50:42,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:50:42,992 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 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 110 [2025-02-08 01:50:42,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:50:42,996 INFO L225 Difference]: With dead ends: 374 [2025-02-08 01:50:42,996 INFO L226 Difference]: Without dead ends: 162 [2025-02-08 01:50:43,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:50:43,002 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:50:43,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:50:43,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-08 01:50:43,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-02-08 01:50:43,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 116 states have (on average 1.2241379310344827) internal successors, (142), 116 states have internal predecessors, (142), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-08 01:50:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 197 transitions. [2025-02-08 01:50:43,039 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 197 transitions. Word has length 110 [2025-02-08 01:50:43,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:50:43,040 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 197 transitions. [2025-02-08 01:50:43,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 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-02-08 01:50:43,040 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 197 transitions. [2025-02-08 01:50:43,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-08 01:50:43,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:50:43,043 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:50:43,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 01:50:43,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-08 01:50:43,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:50:43,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:50:43,249 INFO L85 PathProgramCache]: Analyzing trace with hash -699279691, now seen corresponding path program 1 times [2025-02-08 01:50:43,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:50:43,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080079459] [2025-02-08 01:50:43,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:43,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:50:47,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 01:50:47,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 01:50:47,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:47,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:50:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-08 01:50:48,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:50:48,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080079459] [2025-02-08 01:50:48,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080079459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:50:48,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:50:48,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:50:48,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438628608] [2025-02-08 01:50:48,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:50:48,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:50:48,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:50:48,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:50:48,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:50:48,011 INFO L87 Difference]: Start difference. First operand 162 states and 197 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 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-02-08 01:50:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:50:48,179 INFO L93 Difference]: Finished difference Result 271 states and 318 transitions. [2025-02-08 01:50:48,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:50:48,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 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 110 [2025-02-08 01:50:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:50:48,181 INFO L225 Difference]: With dead ends: 271 [2025-02-08 01:50:48,181 INFO L226 Difference]: Without dead ends: 162 [2025-02-08 01:50:48,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:50:48,182 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:50:48,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 375 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:50:48,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-08 01:50:48,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-02-08 01:50:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 116 states have (on average 1.2155172413793103) internal successors, (141), 116 states have internal predecessors, (141), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-08 01:50:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 196 transitions. [2025-02-08 01:50:48,190 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 196 transitions. Word has length 110 [2025-02-08 01:50:48,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:50:48,191 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 196 transitions. [2025-02-08 01:50:48,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 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-02-08 01:50:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 196 transitions. [2025-02-08 01:50:48,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-08 01:50:48,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:50:48,192 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:50:48,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:50:48,192 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:50:48,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:50:48,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1485989302, now seen corresponding path program 1 times [2025-02-08 01:50:48,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:50:48,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134500404] [2025-02-08 01:50:48,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:48,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:50:52,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-08 01:50:52,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-08 01:50:52,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:52,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:50:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-08 01:50:52,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:50:52,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134500404] [2025-02-08 01:50:52,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134500404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:50:52,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:50:52,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:50:52,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603712576] [2025-02-08 01:50:52,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:50:52,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:50:52,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:50:52,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:50:52,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:50:52,780 INFO L87 Difference]: Start difference. First operand 162 states and 196 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-08 01:50:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:50:53,037 INFO L93 Difference]: Finished difference Result 249 states and 292 transitions. [2025-02-08 01:50:53,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:50:53,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 112 [2025-02-08 01:50:53,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:50:53,039 INFO L225 Difference]: With dead ends: 249 [2025-02-08 01:50:53,039 INFO L226 Difference]: Without dead ends: 162 [2025-02-08 01:50:53,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:50:53,040 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 01:50:53,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 01:50:53,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-08 01:50:53,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-02-08 01:50:53,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 116 states have (on average 1.206896551724138) internal successors, (140), 116 states have internal predecessors, (140), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-08 01:50:53,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 195 transitions. [2025-02-08 01:50:53,053 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 195 transitions. Word has length 112 [2025-02-08 01:50:53,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:50:53,054 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 195 transitions. [2025-02-08 01:50:53,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-08 01:50:53,054 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 195 transitions. [2025-02-08 01:50:53,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-08 01:50:53,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:50:53,056 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:50:53,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:50:53,057 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:50:53,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:50:53,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2014046519, now seen corresponding path program 1 times [2025-02-08 01:50:53,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:50:53,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141251886] [2025-02-08 01:50:53,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:53,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:50:56,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 01:50:56,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 01:50:56,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:56,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:50:59,327 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-08 01:50:59,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:50:59,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141251886] [2025-02-08 01:50:59,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141251886] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:50:59,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:50:59,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:50:59,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443212500] [2025-02-08 01:50:59,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:50:59,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:50:59,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:50:59,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:50:59,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:50:59,329 INFO L87 Difference]: Start difference. First operand 162 states and 195 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-08 01:51:03,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:51:07,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:51:12,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:51:16,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:51:20,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:51:24,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:51:24,630 INFO L93 Difference]: Finished difference Result 175 states and 208 transitions. [2025-02-08 01:51:24,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:51:24,637 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 123 [2025-02-08 01:51:24,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:51:24,640 INFO L225 Difference]: With dead ends: 175 [2025-02-08 01:51:24,640 INFO L226 Difference]: Without dead ends: 167 [2025-02-08 01:51:24,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:51:24,640 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 10 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.7s IncrementalHoareTripleChecker+Time [2025-02-08 01:51:24,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1025 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 5 Unknown, 0 Unchecked, 24.7s Time] [2025-02-08 01:51:24,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-08 01:51:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2025-02-08 01:51:24,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 118 states have internal predecessors, (142), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-08 01:51:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 197 transitions. [2025-02-08 01:51:24,660 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 197 transitions. Word has length 123 [2025-02-08 01:51:24,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:51:24,661 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 197 transitions. [2025-02-08 01:51:24,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-08 01:51:24,662 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 197 transitions. [2025-02-08 01:51:24,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-08 01:51:24,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:51:24,664 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:51:24,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:51:24,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:51:24,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:51:24,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1817533014, now seen corresponding path program 1 times [2025-02-08 01:51:24,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:51:24,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667366458] [2025-02-08 01:51:24,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:51:24,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:51:28,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 01:51:28,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 01:51:28,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:51:28,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:51:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-08 01:51:29,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:51:29,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667366458] [2025-02-08 01:51:29,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667366458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:51:29,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:51:29,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:51:29,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31048198] [2025-02-08 01:51:29,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:51:29,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:51:29,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:51:29,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:51:29,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:51:29,669 INFO L87 Difference]: Start difference. First operand 164 states and 197 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-08 01:51:30,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:51:30,297 INFO L93 Difference]: Finished difference Result 174 states and 207 transitions. [2025-02-08 01:51:30,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:51:30,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 123 [2025-02-08 01:51:30,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:51:30,299 INFO L225 Difference]: With dead ends: 174 [2025-02-08 01:51:30,299 INFO L226 Difference]: Without dead ends: 162 [2025-02-08 01:51:30,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:51:30,300 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 2 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 01:51:30,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 731 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 01:51:30,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-08 01:51:30,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-02-08 01:51:30,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 116 states have (on average 1.1896551724137931) internal successors, (138), 116 states have internal predecessors, (138), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-08 01:51:30,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 193 transitions. [2025-02-08 01:51:30,307 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 193 transitions. Word has length 123 [2025-02-08 01:51:30,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:51:30,307 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 193 transitions. [2025-02-08 01:51:30,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-08 01:51:30,307 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 193 transitions. [2025-02-08 01:51:30,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-08 01:51:30,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:51:30,309 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:51:30,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:51:30,309 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:51:30,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:51:30,309 INFO L85 PathProgramCache]: Analyzing trace with hash 975066298, now seen corresponding path program 1 times [2025-02-08 01:51:30,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:51:30,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145694859] [2025-02-08 01:51:30,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:51:30,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:51:33,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-08 01:51:33,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-08 01:51:33,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:51:33,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:51:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-08 01:51:36,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:51:36,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145694859] [2025-02-08 01:51:36,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145694859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:51:36,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:51:36,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:51:36,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108767432] [2025-02-08 01:51:36,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:51:36,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:51:36,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:51:36,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:51:36,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:51:36,270 INFO L87 Difference]: Start difference. First operand 162 states and 193 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 7 states have internal predecessors, (74), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-08 01:51:40,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:51:44,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:51:47,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:51:47,269 INFO L93 Difference]: Finished difference Result 173 states and 203 transitions. [2025-02-08 01:51:47,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:51:47,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 7 states have internal predecessors, (74), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2025-02-08 01:51:47,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:51:47,276 INFO L225 Difference]: With dead ends: 173 [2025-02-08 01:51:47,276 INFO L226 Difference]: Without dead ends: 162 [2025-02-08 01:51:47,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:51:47,277 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 2 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:51:47,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1048 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 2 Unknown, 0 Unchecked, 11.0s Time] [2025-02-08 01:51:47,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-08 01:51:47,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-02-08 01:51:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 116 states have internal predecessors, (137), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-08 01:51:47,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 192 transitions. [2025-02-08 01:51:47,283 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 192 transitions. Word has length 129 [2025-02-08 01:51:47,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:51:47,283 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 192 transitions. [2025-02-08 01:51:47,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 7 states have internal predecessors, (74), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-08 01:51:47,283 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 192 transitions. [2025-02-08 01:51:47,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-08 01:51:47,284 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:51:47,284 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:51:47,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:51:47,285 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:51:47,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:51:47,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1450480950, now seen corresponding path program 1 times [2025-02-08 01:51:47,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:51:47,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276666582] [2025-02-08 01:51:47,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:51:47,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:51:50,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-08 01:51:50,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-08 01:51:50,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:51:50,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:51:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-08 01:51:55,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:51:55,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276666582] [2025-02-08 01:51:55,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276666582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:51:55,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:51:55,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 01:51:55,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896109691] [2025-02-08 01:51:55,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:51:55,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:51:55,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:51:55,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:51:55,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:51:55,364 INFO L87 Difference]: Start difference. First operand 162 states and 192 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19)