./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness_negated.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ec50af203cf1d5a7d1afbba8c91c6aba29bcfe50c35892731044038eaad7c7f2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:55:54,821 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:55:54,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:55:54,894 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:55:54,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:55:54,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:55:54,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:55:54,919 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:55:54,919 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:55:54,920 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:55:54,920 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:55:54,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:55:54,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:55:54,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:55:54,921 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:55:54,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:55:54,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:55:54,921 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:55:54,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:55:54,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:55:54,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:55:54,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:55:54,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:55:54,922 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:55:54,922 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:55:54,922 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:55:54,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:55:54,922 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:55:54,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:55:54,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:55:54,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:55:54,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:55:54,922 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:55:54,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:55:54,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:55:54,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:55:54,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:55:54,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:55:54,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:55:54,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:55:54,922 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 -> ec50af203cf1d5a7d1afbba8c91c6aba29bcfe50c35892731044038eaad7c7f2 [2025-03-04 02:55:55,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:55:55,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:55:55,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:55:55,158 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:55:55,158 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:55:55,159 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_put_harness_negated.i [2025-03-04 02:55:56,262 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/177d486b1/dd402c25e5244d51a24bfd5114f4e5a3/FLAG608608468 [2025-03-04 02:55:56,797 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:55:56,798 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness_negated.i [2025-03-04 02:55:56,829 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/177d486b1/dd402c25e5244d51a24bfd5114f4e5a3/FLAG608608468 [2025-03-04 02:55:57,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/177d486b1/dd402c25e5244d51a24bfd5114f4e5a3 [2025-03-04 02:55:57,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:55:57,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:55:57,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:55:57,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:55:57,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:55:57,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:55:57" (1/1) ... [2025-03-04 02:55:57,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@465ed24b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:57, skipping insertion in model container [2025-03-04 02:55:57,346 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:55:57" (1/1) ... [2025-03-04 02:55:57,413 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:55:57,613 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_put_harness_negated.i[4492,4505] [2025-03-04 02:55:57,620 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_put_harness_negated.i[4552,4565] [2025-03-04 02:55:58,445 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:58,446 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:58,446 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:58,447 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:58,447 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:58,460 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:58,461 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:58,466 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:58,466 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:58,468 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:58,468 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:58,469 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:58,469 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,214 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,215 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,238 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,238 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,243 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,243 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,256 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,257 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,258 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,258 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,258 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,259 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,259 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,288 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_put_harness_negated.i[229379,229392] [2025-03-04 02:55:59,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:55:59,316 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:55:59,326 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_put_harness_negated.i[4492,4505] [2025-03-04 02:55:59,326 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_put_harness_negated.i[4552,4565] [2025-03-04 02:55:59,363 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,364 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,364 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,364 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,365 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,370 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,370 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,370 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,370 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,371 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,371 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,371 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,372 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,426 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7544-7555] [2025-03-04 02:55:59,519 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,520 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,524 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,524 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,526 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,526 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,531 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,531 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,531 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,531 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,532 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,532 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,532 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:59,544 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_put_harness_negated.i[229379,229392] [2025-03-04 02:55:59,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:55:59,683 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:55:59,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:59 WrapperNode [2025-03-04 02:55:59,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:55:59,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:55:59,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:55:59,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:55:59,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:59" (1/1) ... [2025-03-04 02:55:59,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:59" (1/1) ... [2025-03-04 02:55:59,843 INFO L138 Inliner]: procedures = 764, calls = 2484, calls flagged for inlining = 71, calls inlined = 25, statements flattened = 1463 [2025-03-04 02:55:59,844 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:55:59,844 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:55:59,844 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:55:59,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:55:59,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:59" (1/1) ... [2025-03-04 02:55:59,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:59" (1/1) ... [2025-03-04 02:55:59,863 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:59" (1/1) ... [2025-03-04 02:55:59,872 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 02:55:59,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:59" (1/1) ... [2025-03-04 02:55:59,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:59" (1/1) ... [2025-03-04 02:55:59,913 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:59" (1/1) ... [2025-03-04 02:55:59,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:59" (1/1) ... [2025-03-04 02:55:59,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:59" (1/1) ... [2025-03-04 02:55:59,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:59" (1/1) ... [2025-03-04 02:55:59,956 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:55:59,957 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:55:59,957 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:55:59,957 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:55:59,959 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:59" (1/1) ... [2025-03-04 02:55:59,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:55:59,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:55:59,987 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:55:59,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:56:00,008 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2025-03-04 02:56:00,008 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2025-03-04 02:56:00,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 02:56:00,008 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_keys_eq [2025-03-04 02:56:00,008 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_keys_eq [2025-03-04 02:56:00,008 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2025-03-04 02:56:00,008 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2025-03-04 02:56:00,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:56:00,009 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-03-04 02:56:00,009 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-03-04 02:56:00,009 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-03-04 02:56:00,009 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-03-04 02:56:00,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2025-03-04 02:56:00,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 02:56:00,009 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2025-03-04 02:56:00,009 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2025-03-04 02:56:00,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 02:56:00,009 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-04 02:56:00,009 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-04 02:56:00,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:56:00,009 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:56:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 02:56:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-03-04 02:56:00,011 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-03-04 02:56:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:56:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:56:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-03-04 02:56:00,011 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-03-04 02:56:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 02:56:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 02:56:00,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 02:56:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2025-03-04 02:56:00,011 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2025-03-04 02:56:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure s_safe_eq_check [2025-03-04 02:56:00,011 INFO L138 BoogieDeclarations]: Found implementation of procedure s_safe_eq_check [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure s_emplace_item [2025-03-04 02:56:00,012 INFO L138 BoogieDeclarations]: Found implementation of procedure s_emplace_item [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:56:00,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-03-04 02:56:00,012 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-04 02:56:00,012 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure s_find_entry [2025-03-04 02:56:00,012 INFO L138 BoogieDeclarations]: Found implementation of procedure s_find_entry [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2025-03-04 02:56:00,012 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:56:00,012 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-03-04 02:56:00,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-03-04 02:56:00,012 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-03-04 02:56:00,012 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-04 02:56:00,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-03-04 02:56:00,012 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-04 02:56:00,012 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_for [2025-03-04 02:56:00,012 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_for [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2025-03-04 02:56:00,012 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-04 02:56:00,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 02:56:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-03-04 02:56:00,013 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-03-04 02:56:00,312 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:56:00,315 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:56:00,361 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6935: havoc #t~malloc588.base, #t~malloc588.offset; [2025-03-04 02:56:00,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9974: havoc #t~mem1491.base, #t~mem1491.offset;havoc #t~short1492;havoc #t~mem1493.base, #t~mem1493.offset;havoc #t~ret1494;havoc #t~short1495; [2025-03-04 02:56:00,387 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-03-04 02:56:00,416 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10087: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-03-04 02:56:00,445 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6943: havoc #t~ret589#1;havoc #t~ite591#1.base, #t~ite591#1.offset;havoc #t~ret590#1.base, #t~ret590#1.offset; [2025-03-04 02:56:00,446 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6928: havoc bounded_calloc_#t~malloc587#1.base, bounded_calloc_#t~malloc587#1.offset;call ULTIMATE.dealloc(bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset);havoc bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset; [2025-03-04 02:56:00,600 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9169: call ULTIMATE.dealloc(~#size~0#1.base, ~#size~0#1.offset);havoc ~#size~0#1.base, ~#size~0#1.offset; [2025-03-04 02:56:00,600 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: havoc aws_round_up_to_power_of_two_#t~ret62#1; [2025-03-04 02:56:00,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6974: havoc #t~ret600.base, #t~ret600.offset; [2025-03-04 02:56:00,628 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9122-1: assume false; [2025-03-04 02:56:00,629 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9122-1: assume !false; [2025-03-04 02:56:00,647 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-03-04 02:56:00,648 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-04 02:56:00,666 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9083-1: assume false; [2025-03-04 02:56:00,667 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9083-1: assume !false; [2025-03-04 02:56:00,667 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7341: havoc uninterpreted_hasher_#t~ret689#1; [2025-03-04 02:56:00,697 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7328: havoc uninterpreted_equals_assert_inputs_nonnull_#t~ret687#1; [2025-03-04 02:56:00,698 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7271: havoc nondet_compare_#t~ret677#1; [2025-03-04 02:56:00,698 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L262: havoc nondet_int_#t~nondet5#1; [2025-03-04 02:56:00,734 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9109: havoc #t~ret1142; [2025-03-04 02:56:00,968 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9140: call ULTIMATE.dealloc(~#required_bytes~3#1.base, ~#required_bytes~3#1.offset);havoc ~#required_bytes~3#1.base, ~#required_bytes~3#1.offset; [2025-03-04 02:56:00,969 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6997: call ULTIMATE.dealloc(aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset);havoc aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset; [2025-03-04 02:56:01,045 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9444-1: assume false; [2025-03-04 02:56:01,045 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9444-1: assume !false; [2025-03-04 02:56:01,045 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9403-1: assume false; [2025-03-04 02:56:01,045 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9403-1: assume !false; [2025-03-04 02:56:01,118 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9311: havoc #t~ret1203#1; [2025-03-04 02:56:01,145 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-03-04 02:56:01,168 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-03-04 02:56:06,871 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9550: call ULTIMATE.dealloc(aws_hash_table_put_~#p_elem~0#1.base, aws_hash_table_put_~#p_elem~0#1.offset);havoc aws_hash_table_put_~#p_elem~0#1.base, aws_hash_table_put_~#p_elem~0#1.offset;call ULTIMATE.dealloc(aws_hash_table_put_~#was_created_fallback~0#1.base, aws_hash_table_put_~#was_created_fallback~0#1.offset);havoc aws_hash_table_put_~#was_created_fallback~0#1.base, aws_hash_table_put_~#was_created_fallback~0#1.offset; [2025-03-04 02:56:06,871 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9452: call ULTIMATE.dealloc(s_expand_table_~#template~1#1.base, s_expand_table_~#template~1#1.offset);havoc s_expand_table_~#template~1#1.base, s_expand_table_~#template~1#1.offset;call ULTIMATE.dealloc(s_expand_table_~#new_size~0#1.base, s_expand_table_~#new_size~0#1.offset);havoc s_expand_table_~#new_size~0#1.base, s_expand_table_~#new_size~0#1.offset; [2025-03-04 02:56:06,871 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6821: havoc aws_hash_table_has_an_empty_slot_#t~mem566#1.base, aws_hash_table_has_an_empty_slot_#t~mem566#1.offset;havoc aws_hash_table_has_an_empty_slot_#t~ret567#1; [2025-03-04 02:56:06,871 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9490: call ULTIMATE.dealloc(aws_hash_table_create_~#entry~4#1.base, aws_hash_table_create_~#entry~4#1.offset);havoc aws_hash_table_create_~#entry~4#1.base, aws_hash_table_create_~#entry~4#1.offset;call ULTIMATE.dealloc(aws_hash_table_create_~#probe_idx~1#1.base, aws_hash_table_create_~#probe_idx~1#1.offset);havoc aws_hash_table_create_~#probe_idx~1#1.base, aws_hash_table_create_~#probe_idx~1#1.offset;call ULTIMATE.dealloc(aws_hash_table_create_~#ignored~0#1.base, aws_hash_table_create_~#ignored~0#1.offset);havoc aws_hash_table_create_~#ignored~0#1.base, aws_hash_table_create_~#ignored~0#1.offset;call ULTIMATE.dealloc(aws_hash_table_create_~#incr_entry_count~0#1.base, aws_hash_table_create_~#incr_entry_count~0#1.offset);havoc aws_hash_table_create_~#incr_entry_count~0#1.base, aws_hash_table_create_~#incr_entry_count~0#1.offset;call ULTIMATE.dealloc(aws_hash_table_create_~#new_entry~0#1.base, aws_hash_table_create_~#new_entry~0#1.offset);havoc aws_hash_table_create_~#new_entry~0#1.base, aws_hash_table_create_~#new_entry~0#1.offset; [2025-03-04 02:56:06,872 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6831: havoc hash_table_state_has_an_empty_slot_#t~mem571#1; [2025-03-04 02:56:07,018 INFO L? ?]: Removed 447 outVars from TransFormulas that were not future-live. [2025-03-04 02:56:07,018 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:56:07,056 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:56:07,059 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:56:07,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:56:07 BoogieIcfgContainer [2025-03-04 02:56:07,059 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:56:07,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:56:07,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:56:07,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:56:07,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:55:57" (1/3) ... [2025-03-04 02:56:07,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee09212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:56:07, skipping insertion in model container [2025-03-04 02:56:07,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:59" (2/3) ... [2025-03-04 02:56:07,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee09212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:56:07, skipping insertion in model container [2025-03-04 02:56:07,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:56:07" (3/3) ... [2025-03-04 02:56:07,068 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_put_harness_negated.i [2025-03-04 02:56:07,080 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:56:07,081 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_put_harness_negated.i that has 30 procedures, 409 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-03-04 02:56:07,135 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:56:07,143 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;@3d0aba65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:56:07,143 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:56:07,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 409 states, 296 states have (on average 1.3074324324324325) internal successors, (387), 293 states have internal predecessors, (387), 86 states have call successors, (86), 29 states have call predecessors, (86), 29 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-04 02:56:07,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 02:56:07,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:56:07,160 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:56:07,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:56:07,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:56:07,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1440740924, now seen corresponding path program 1 times [2025-03-04 02:56:07,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:56:07,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262571291] [2025-03-04 02:56:07,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:56:07,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:56:11,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 02:56:11,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 02:56:11,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:56:11,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:56:12,138 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-03-04 02:56:12,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:56:12,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262571291] [2025-03-04 02:56:12,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262571291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:56:12,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486826238] [2025-03-04 02:56:12,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:56:12,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:56:12,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:56:12,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:56:12,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:56:16,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 02:56:16,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 02:56:16,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:56:16,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:56:16,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 4502 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 02:56:16,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:56:16,821 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-03-04 02:56:16,824 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:56:16,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486826238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:56:16,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:56:16,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 02:56:16,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884317735] [2025-03-04 02:56:16,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:56:16,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:56:16,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:56:16,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:56:16,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:56:16,843 INFO L87 Difference]: Start difference. First operand has 409 states, 296 states have (on average 1.3074324324324325) internal successors, (387), 293 states have internal predecessors, (387), 86 states have call successors, (86), 29 states have call predecessors, (86), 29 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 02:56:17,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:56:17,027 INFO L93 Difference]: Finished difference Result 812 states and 1166 transitions. [2025-03-04 02:56:17,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:56:17,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 134 [2025-03-04 02:56:17,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:56:17,038 INFO L225 Difference]: With dead ends: 812 [2025-03-04 02:56:17,039 INFO L226 Difference]: Without dead ends: 403 [2025-03-04 02:56:17,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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-04 02:56:17,044 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:56:17,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 536 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:56:17,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-04 02:56:17,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-03-04 02:56:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 287 states have (on average 1.2961672473867596) internal successors, (372), 288 states have internal predecessors, (372), 86 states have call successors, (86), 29 states have call predecessors, (86), 29 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 02:56:17,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 543 transitions. [2025-03-04 02:56:17,093 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 543 transitions. Word has length 134 [2025-03-04 02:56:17,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:56:17,094 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 543 transitions. [2025-03-04 02:56:17,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 02:56:17,094 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 543 transitions. [2025-03-04 02:56:17,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 02:56:17,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:56:17,096 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:56:17,111 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-04 02:56:17,297 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-04 02:56:17,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:56:17,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:56:17,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1163791975, now seen corresponding path program 1 times [2025-03-04 02:56:17,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:56:17,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131511873] [2025-03-04 02:56:17,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:56:17,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:56:21,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 02:56:21,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 02:56:21,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:56:21,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:56:22,150 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-04 02:56:22,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:56:22,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131511873] [2025-03-04 02:56:22,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131511873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:56:22,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:56:22,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:56:22,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800475641] [2025-03-04 02:56:22,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:56:22,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:56:22,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:56:22,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:56:22,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:56:22,153 INFO L87 Difference]: Start difference. First operand 403 states and 543 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 02:56:22,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:56:22,866 INFO L93 Difference]: Finished difference Result 802 states and 1084 transitions. [2025-03-04 02:56:22,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:56:22,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 134 [2025-03-04 02:56:22,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:56:22,873 INFO L225 Difference]: With dead ends: 802 [2025-03-04 02:56:22,873 INFO L226 Difference]: Without dead ends: 408 [2025-03-04 02:56:22,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:56:22,876 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 0 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2108 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 02:56:22,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2108 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 02:56:22,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-04 02:56:22,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2025-03-04 02:56:22,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 291 states have (on average 1.2920962199312716) internal successors, (376), 292 states have internal predecessors, (376), 86 states have call successors, (86), 29 states have call predecessors, (86), 30 states have return successors, (89), 86 states have call predecessors, (89), 85 states have call successors, (89) [2025-03-04 02:56:22,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 551 transitions. [2025-03-04 02:56:22,912 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 551 transitions. Word has length 134 [2025-03-04 02:56:22,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:56:22,914 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 551 transitions. [2025-03-04 02:56:22,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 02:56:22,914 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 551 transitions. [2025-03-04 02:56:22,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 02:56:22,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:56:22,917 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:56:22,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:56:22,918 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:56:22,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:56:22,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1529507522, now seen corresponding path program 1 times [2025-03-04 02:56:22,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:56:22,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603281503] [2025-03-04 02:56:22,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:56:22,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:56:26,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 02:56:26,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 02:56:26,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:56:26,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:56:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-04 02:56:30,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:56:30,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603281503] [2025-03-04 02:56:30,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603281503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:56:30,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:56:30,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:56:30,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361683456] [2025-03-04 02:56:30,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:56:30,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:56:30,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:56:30,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:56:30,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:56:30,230 INFO L87 Difference]: Start difference. First operand 408 states and 551 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 states have internal predecessors, (66), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 02:56:34,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:56:38,659 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-03-04 02:56:43,072 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-04 02:56:47,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:56:55,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:56:55,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:56:55,489 INFO L93 Difference]: Finished difference Result 803 states and 1084 transitions. [2025-03-04 02:56:55,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:56:55,494 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 states have internal predecessors, (66), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 140 [2025-03-04 02:56:55,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:56:55,499 INFO L225 Difference]: With dead ends: 803 [2025-03-04 02:56:55,499 INFO L226 Difference]: Without dead ends: 416 [2025-03-04 02:56:55,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:56:55,503 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 11 mSDsluCounter, 3424 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3946 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.6s IncrementalHoareTripleChecker+Time [2025-03-04 02:56:55,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3946 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 368 Invalid, 4 Unknown, 0 Unchecked, 24.6s Time] [2025-03-04 02:56:55,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-04 02:56:55,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 413. [2025-03-04 02:56:55,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 295 states have (on average 1.2915254237288136) internal successors, (381), 297 states have internal predecessors, (381), 86 states have call successors, (86), 29 states have call predecessors, (86), 31 states have return successors, (90), 86 states have call predecessors, (90), 85 states have call successors, (90) [2025-03-04 02:56:55,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 557 transitions. [2025-03-04 02:56:55,531 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 557 transitions. Word has length 140 [2025-03-04 02:56:55,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:56:55,531 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 557 transitions. [2025-03-04 02:56:55,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 states have internal predecessors, (66), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 02:56:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 557 transitions. [2025-03-04 02:56:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 02:56:55,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:56:55,534 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:56:55,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:56:55,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:56:55,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:56:55,535 INFO L85 PathProgramCache]: Analyzing trace with hash 573986243, now seen corresponding path program 1 times [2025-03-04 02:56:55,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:56:55,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174012577] [2025-03-04 02:56:55,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:56:55,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:56:59,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 02:56:59,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 02:56:59,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:56:59,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:00,688 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-04 02:57:00,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:00,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174012577] [2025-03-04 02:57:00,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174012577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:00,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:00,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:57:00,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18169368] [2025-03-04 02:57:00,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:00,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:57:00,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:00,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:57:00,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:57:00,692 INFO L87 Difference]: Start difference. First operand 413 states and 557 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-04 02:57:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:02,020 INFO L93 Difference]: Finished difference Result 810 states and 1092 transitions. [2025-03-04 02:57:02,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:57:02,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 140 [2025-03-04 02:57:02,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:02,024 INFO L225 Difference]: With dead ends: 810 [2025-03-04 02:57:02,024 INFO L226 Difference]: Without dead ends: 411 [2025-03-04 02:57:02,025 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-04 02:57:02,026 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 80 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:02,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1979 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 02:57:02,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-04 02:57:02,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-03-04 02:57:02,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 293 states have (on average 1.286689419795222) internal successors, (377), 295 states have internal predecessors, (377), 86 states have call successors, (86), 29 states have call predecessors, (86), 31 states have return successors, (90), 86 states have call predecessors, (90), 85 states have call successors, (90) [2025-03-04 02:57:02,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 553 transitions. [2025-03-04 02:57:02,046 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 553 transitions. Word has length 140 [2025-03-04 02:57:02,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:02,047 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 553 transitions. [2025-03-04 02:57:02,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-04 02:57:02,047 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 553 transitions. [2025-03-04 02:57:02,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 02:57:02,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:02,049 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:02,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:57:02,049 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:02,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:02,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1663627532, now seen corresponding path program 1 times [2025-03-04 02:57:02,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:02,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482721602] [2025-03-04 02:57:02,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:02,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:05,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 02:57:05,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 02:57:05,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:05,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-04 02:57:08,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:08,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482721602] [2025-03-04 02:57:08,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482721602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:08,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929544509] [2025-03-04 02:57:08,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:08,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:08,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:08,181 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:57:08,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:57:12,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 02:57:12,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 02:57:12,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:12,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:12,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 4530 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 02:57:12,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:14,732 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 02:57:14,732 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:14,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929544509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:14,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:14,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2025-03-04 02:57:14,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006328251] [2025-03-04 02:57:14,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:14,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:57:14,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:14,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:57:14,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:57:14,734 INFO L87 Difference]: Start difference. First operand 411 states and 553 transitions. Second operand has 9 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (25), 2 states have call predecessors, (25), 5 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 02:57:19,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:19,083 INFO L93 Difference]: Finished difference Result 807 states and 1090 transitions. [2025-03-04 02:57:19,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:57:19,083 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (25), 2 states have call predecessors, (25), 5 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) Word has length 146 [2025-03-04 02:57:19,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:19,086 INFO L225 Difference]: With dead ends: 807 [2025-03-04 02:57:19,087 INFO L226 Difference]: Without dead ends: 417 [2025-03-04 02:57:19,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:57:19,088 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 0 mSDsluCounter, 3499 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4006 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:19,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4006 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-04 02:57:19,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-04 02:57:19,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 414. [2025-03-04 02:57:19,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 295 states have (on average 1.2847457627118644) internal successors, (379), 297 states have internal predecessors, (379), 86 states have call successors, (86), 29 states have call predecessors, (86), 32 states have return successors, (97), 87 states have call predecessors, (97), 85 states have call successors, (97) [2025-03-04 02:57:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 562 transitions. [2025-03-04 02:57:19,108 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 562 transitions. Word has length 146 [2025-03-04 02:57:19,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:19,109 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 562 transitions. [2025-03-04 02:57:19,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (25), 2 states have call predecessors, (25), 5 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 02:57:19,110 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 562 transitions. [2025-03-04 02:57:19,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 02:57:19,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:19,112 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:19,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:57:19,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:19,313 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:19,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:19,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1079722764, now seen corresponding path program 1 times [2025-03-04 02:57:19,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:19,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322336138] [2025-03-04 02:57:19,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:19,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:22,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 02:57:23,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 02:57:23,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:23,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-04 02:57:25,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:25,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322336138] [2025-03-04 02:57:25,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322336138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:25,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:25,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:57:25,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002628610] [2025-03-04 02:57:25,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:25,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:57:25,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:25,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:57:25,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:57:25,416 INFO L87 Difference]: Start difference. First operand 414 states and 562 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24)