./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_iter_done_harness.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_iter_done_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6d54635a45b4bea3ce8bb2da849d6298e1094d0c6d7d45bb3baae6f41da1bbe7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:52:44,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:52:44,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:52:44,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:52:44,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:52:44,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:52:44,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:52:44,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:52:44,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:52:44,482 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:52:44,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:52:44,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:52:44,483 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:52:44,484 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:52:44,484 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:52:44,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:52:44,484 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:52:44,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:52:44,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:52:44,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:52:44,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:52:44,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:52:44,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:52:44,485 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:52:44,485 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:52:44,485 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:52:44,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:52:44,485 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:52:44,485 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:52:44,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:52:44,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:52:44,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:52:44,486 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:52:44,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:52:44,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:52:44,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:52:44,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:52:44,487 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:52:44,487 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:52:44,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:52:44,487 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 -> 6d54635a45b4bea3ce8bb2da849d6298e1094d0c6d7d45bb3baae6f41da1bbe7 [2025-03-04 02:52:44,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:52:44,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:52:44,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:52:44,733 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:52:44,733 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:52:44,734 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_iter_done_harness.i [2025-03-04 02:52:45,947 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ba91f84c/5c34504d709e4827a9d2eb884c212fb8/FLAG9aa666f41 [2025-03-04 02:52:46,440 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:52:46,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_iter_done_harness.i [2025-03-04 02:52:46,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ba91f84c/5c34504d709e4827a9d2eb884c212fb8/FLAG9aa666f41 [2025-03-04 02:52:46,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ba91f84c/5c34504d709e4827a9d2eb884c212fb8 [2025-03-04 02:52:46,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:52:46,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:52:46,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:52:46,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:52:46,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:52:46,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:52:46" (1/1) ... [2025-03-04 02:52:46,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52df74a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:46, skipping insertion in model container [2025-03-04 02:52:46,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:52:46" (1/1) ... [2025-03-04 02:52:46,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:52:46,786 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_iter_done_harness.i[4492,4505] [2025-03-04 02:52:46,794 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_iter_done_harness.i[4552,4565] [2025-03-04 02:52:47,556 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,557 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,557 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,558 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,559 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,571 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,571 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,573 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,573 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,576 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,578 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,579 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,580 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,352 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,353 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,377 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,377 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,381 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,382 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,393 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,394 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,394 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,395 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,395 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,395 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,395 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,425 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_iter_done_harness.i[228041,228054] [2025-03-04 02:52:48,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:52:48,452 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:52:48,466 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_iter_done_harness.i[4492,4505] [2025-03-04 02:52:48,466 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_iter_done_harness.i[4552,4565] [2025-03-04 02:52:48,493 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,494 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,494 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,494 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,495 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,500 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,503 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,504 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,504 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,505 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,505 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,505 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,505 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,580 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7558-7569] [2025-03-04 02:52:48,669 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,670 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,675 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,676 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,678 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,678 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,683 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,684 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,684 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,684 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,684 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,685 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,686 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,701 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_iter_done_harness.i[228041,228054] [2025-03-04 02:52:48,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:52:48,839 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:52:48,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:48 WrapperNode [2025-03-04 02:52:48,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:52:48,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:52:48,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:52:48,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:52:48,846 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:52:48" (1/1) ... [2025-03-04 02:52:48,916 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:52:48" (1/1) ... [2025-03-04 02:52:48,973 INFO L138 Inliner]: procedures = 763, calls = 2449, calls flagged for inlining = 68, calls inlined = 11, statements flattened = 644 [2025-03-04 02:52:48,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:52:48,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:52:48,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:52:48,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:52:48,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:48" (1/1) ... [2025-03-04 02:52:48,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:48" (1/1) ... [2025-03-04 02:52:48,991 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:48" (1/1) ... [2025-03-04 02:52:49,038 INFO L175 MemorySlicer]: Split 318 memory accesses to 9 slices as follows [238, 2, 36, 6, 2, 3, 19, 7, 5]. 75 percent of accesses are in the largest equivalence class. The 22 initializations are split as follows [6, 2, 9, 0, 0, 0, 0, 0, 5]. The 239 writes are split as follows [232, 0, 1, 2, 1, 1, 1, 1, 0]. [2025-03-04 02:52:49,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:48" (1/1) ... [2025-03-04 02:52:49,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:48" (1/1) ... [2025-03-04 02:52:49,066 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:48" (1/1) ... [2025-03-04 02:52:49,069 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:48" (1/1) ... [2025-03-04 02:52:49,076 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:48" (1/1) ... [2025-03-04 02:52:49,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:48" (1/1) ... [2025-03-04 02:52:49,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:52:49,087 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:52:49,087 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:52:49,087 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:52:49,088 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:48" (1/1) ... [2025-03-04 02:52:49,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:52:49,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:52:49,119 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:52:49,123 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:52:49,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 02:52:49,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 02:52:49,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 02:52:49,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 02:52:49,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 02:52:49,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 02:52:49,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-04 02:52:49,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-04 02:52:49,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-04 02:52:49,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:52:49,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 02:52:49,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 02:52:49,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 02:52:49,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 02:52:49,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 02:52:49,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 02:52:49,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 02:52:49,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 02:52:49,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 02:52:49,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:52:49,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:52:49,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:52:49,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 02:52:49,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 02:52:49,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 02:52:49,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 02:52:49,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 02:52:49,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 02:52:49,141 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_iter_done [2025-03-04 02:52:49,141 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_iter_done [2025-03-04 02:52:49,141 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-04 02:52:49,141 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-04 02:52:49,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:52:49,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-03-04 02:52:49,142 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-03-04 02:52:49,142 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:52:49,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-03-04 02:52:49,142 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-04 02:52:49,142 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:52:49,142 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_iter_is_valid [2025-03-04 02:52:49,142 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_iter_is_valid [2025-03-04 02:52:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-03-04 02:52:49,143 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-03-04 02:52:49,143 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-04 02:52:49,143 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-03-04 02:52:49,143 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-04 02:52:49,143 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:52:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:52:49,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 02:52:49,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 02:52:49,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 02:52:49,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 02:52:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 02:52:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 02:52:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-03-04 02:52:49,145 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-03-04 02:52:49,426 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:52:49,428 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:52:49,469 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6947: havoc #t~malloc588.base, #t~malloc588.offset; [2025-03-04 02:52:49,490 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-03-04 02:52:49,492 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-04 02:52:49,585 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10103: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-03-04 02:52:49,655 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9990: havoc #t~mem1489.base, #t~mem1489.offset;havoc #t~short1490;havoc #t~mem1491.base, #t~mem1491.offset;havoc #t~ret1492;havoc #t~short1493; [2025-03-04 02:52:49,679 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-03-04 02:52:49,692 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-03-04 02:52:54,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc nondet_size_t_#t~nondet6#1; [2025-03-04 02:52:54,897 INFO L? ?]: Removed 154 outVars from TransFormulas that were not future-live. [2025-03-04 02:52:54,897 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:52:54,913 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:52:54,915 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:52:54,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:52:54 BoogieIcfgContainer [2025-03-04 02:52:54,915 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:52:54,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:52:54,918 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:52:54,921 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:52:54,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:52:46" (1/3) ... [2025-03-04 02:52:54,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b32af7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:52:54, skipping insertion in model container [2025-03-04 02:52:54,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:48" (2/3) ... [2025-03-04 02:52:54,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b32af7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:52:54, skipping insertion in model container [2025-03-04 02:52:54,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:52:54" (3/3) ... [2025-03-04 02:52:54,924 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_iter_done_harness.i [2025-03-04 02:52:54,935 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:52:54,936 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_iter_done_harness.i that has 16 procedures, 163 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-04 02:52:54,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:52:54,991 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;@bbce88f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:52:54,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:52:54,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 163 states, 106 states have (on average 1.2452830188679245) internal successors, (132), 107 states have internal predecessors, (132), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 02:52:55,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 02:52:55,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:52:55,007 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 02:52:55,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:52:55,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:52:55,012 INFO L85 PathProgramCache]: Analyzing trace with hash 436238726, now seen corresponding path program 1 times [2025-03-04 02:52:55,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:52:55,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240859202] [2025-03-04 02:52:55,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:52:55,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:52:59,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 02:52:59,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 02:52:59,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:52:59,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:00,351 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-04 02:53:00,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:53:00,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240859202] [2025-03-04 02:53:00,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240859202] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:53:00,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149466395] [2025-03-04 02:53:00,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:00,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:53:00,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:53:00,359 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:53:00,360 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:53:04,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 02:53:05,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 02:53:05,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:53:05,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:05,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 4452 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 02:53:05,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:53:05,353 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-04 02:53:05,353 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:53:05,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149466395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:53:05,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:53:05,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 02:53:05,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807002594] [2025-03-04 02:53:05,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:53:05,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:53:05,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:53:05,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:53:05,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:53:05,376 INFO L87 Difference]: Start difference. First operand has 163 states, 106 states have (on average 1.2452830188679245) internal successors, (132), 107 states have internal predecessors, (132), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 02:53:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:53:05,417 INFO L93 Difference]: Finished difference Result 318 states and 446 transitions. [2025-03-04 02:53:05,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:53:05,420 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 142 [2025-03-04 02:53:05,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:53:05,425 INFO L225 Difference]: With dead ends: 318 [2025-03-04 02:53:05,425 INFO L226 Difference]: Without dead ends: 157 [2025-03-04 02:53:05,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 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:53:05,429 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:53:05,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:53:05,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-04 02:53:05,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-04 02:53:05,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 101 states have (on average 1.2277227722772277) internal successors, (124), 102 states have internal predecessors, (124), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-04 02:53:05,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 203 transitions. [2025-03-04 02:53:05,458 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 203 transitions. Word has length 142 [2025-03-04 02:53:05,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:53:05,459 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 203 transitions. [2025-03-04 02:53:05,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 02:53:05,459 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 203 transitions. [2025-03-04 02:53:05,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 02:53:05,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:53:05,462 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 02:53:05,477 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:53:05,663 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:53:05,663 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:53:05,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:53:05,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1523240504, now seen corresponding path program 1 times [2025-03-04 02:53:05,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:53:05,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221379507] [2025-03-04 02:53:05,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:05,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:53:09,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 02:53:09,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 02:53:09,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:53:09,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:10,425 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-03-04 02:53:10,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:53:10,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221379507] [2025-03-04 02:53:10,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221379507] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:53:10,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622480741] [2025-03-04 02:53:10,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:10,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:53:10,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:53:10,430 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:53:10,431 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:53:14,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 02:53:15,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 02:53:15,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:53:15,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:15,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 4452 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:53:15,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:53:17,179 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 115 proven. 20 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 02:53:17,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:53:19,765 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-03-04 02:53:19,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622480741] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:53:19,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:53:19,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2025-03-04 02:53:19,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724504471] [2025-03-04 02:53:19,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:53:19,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:53:19,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:53:19,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:53:19,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:53:19,767 INFO L87 Difference]: Start difference. First operand 157 states and 203 transitions. Second operand has 12 states, 12 states have (on average 11.0) internal successors, (132), 12 states have internal predecessors, (132), 6 states have call successors, (55), 3 states have call predecessors, (55), 5 states have return successors, (54), 7 states have call predecessors, (54), 6 states have call successors, (54) [2025-03-04 02:53:23,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:53:23,923 INFO L93 Difference]: Finished difference Result 313 states and 410 transitions. [2025-03-04 02:53:23,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:53:23,924 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.0) internal successors, (132), 12 states have internal predecessors, (132), 6 states have call successors, (55), 3 states have call predecessors, (55), 5 states have return successors, (54), 7 states have call predecessors, (54), 6 states have call successors, (54) Word has length 142 [2025-03-04 02:53:23,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:53:23,927 INFO L225 Difference]: With dead ends: 313 [2025-03-04 02:53:23,927 INFO L226 Difference]: Without dead ends: 168 [2025-03-04 02:53:23,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:53:23,930 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 179 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-04 02:53:23,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1279 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-04 02:53:23,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-04 02:53:23,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2025-03-04 02:53:23,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 106 states have (on average 1.2169811320754718) internal successors, (129), 108 states have internal predecessors, (129), 40 states have call successors, (40), 15 states have call predecessors, (40), 17 states have return successors, (42), 40 states have call predecessors, (42), 39 states have call successors, (42) [2025-03-04 02:53:23,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 211 transitions. [2025-03-04 02:53:23,945 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 211 transitions. Word has length 142 [2025-03-04 02:53:23,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:53:23,946 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 211 transitions. [2025-03-04 02:53:23,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.0) internal successors, (132), 12 states have internal predecessors, (132), 6 states have call successors, (55), 3 states have call predecessors, (55), 5 states have return successors, (54), 7 states have call predecessors, (54), 6 states have call successors, (54) [2025-03-04 02:53:23,946 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 211 transitions. [2025-03-04 02:53:23,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 02:53:23,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:53:23,948 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 02:53:23,965 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:53:24,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 02:53:24,149 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:53:24,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:53:24,150 INFO L85 PathProgramCache]: Analyzing trace with hash -726673744, now seen corresponding path program 1 times [2025-03-04 02:53:24,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:53:24,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881841384] [2025-03-04 02:53:24,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:24,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:53:27,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 02:53:27,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 02:53:27,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:53:27,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:31,348 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-04 02:53:31,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:53:31,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881841384] [2025-03-04 02:53:31,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881841384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:53:31,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:53:31,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:53:31,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875586555] [2025-03-04 02:53:31,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:53:31,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:53:31,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:53:31,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:53:31,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:53:31,350 INFO L87 Difference]: Start difference. First operand 164 states and 211 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-04 02:53:34,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:53:34,035 INFO L93 Difference]: Finished difference Result 312 states and 404 transitions. [2025-03-04 02:53:34,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:53:34,035 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 155 [2025-03-04 02:53:34,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:53:34,037 INFO L225 Difference]: With dead ends: 312 [2025-03-04 02:53:34,037 INFO L226 Difference]: Without dead ends: 172 [2025-03-04 02:53:34,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:53:34,038 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 27 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-04 02:53:34,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1352 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-04 02:53:34,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-04 02:53:34,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 169. [2025-03-04 02:53:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 110 states have (on average 1.2181818181818183) internal successors, (134), 113 states have internal predecessors, (134), 40 states have call successors, (40), 15 states have call predecessors, (40), 18 states have return successors, (43), 40 states have call predecessors, (43), 39 states have call successors, (43) [2025-03-04 02:53:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 217 transitions. [2025-03-04 02:53:34,049 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 217 transitions. Word has length 155 [2025-03-04 02:53:34,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:53:34,052 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 217 transitions. [2025-03-04 02:53:34,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-04 02:53:34,052 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 217 transitions. [2025-03-04 02:53:34,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 02:53:34,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:53:34,054 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 02:53:34,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:53:34,054 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:53:34,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:53:34,054 INFO L85 PathProgramCache]: Analyzing trace with hash 923463055, now seen corresponding path program 1 times [2025-03-04 02:53:34,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:53:34,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511964022] [2025-03-04 02:53:34,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:34,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:53:37,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 02:53:37,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 02:53:37,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:53:37,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:38,778 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-04 02:53:38,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:53:38,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511964022] [2025-03-04 02:53:38,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511964022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:53:38,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:53:38,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:53:38,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192331017] [2025-03-04 02:53:38,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:53:38,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:53:38,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:53:38,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:53:38,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:53:38,780 INFO L87 Difference]: Start difference. First operand 169 states and 217 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-04 02:53:39,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:53:39,060 INFO L93 Difference]: Finished difference Result 319 states and 411 transitions. [2025-03-04 02:53:39,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:53:39,060 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), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 155 [2025-03-04 02:53:39,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:53:39,062 INFO L225 Difference]: With dead ends: 319 [2025-03-04 02:53:39,062 INFO L226 Difference]: Without dead ends: 174 [2025-03-04 02:53:39,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:53:39,063 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 22 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 02:53:39,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 554 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 02:53:39,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-04 02:53:39,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2025-03-04 02:53:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 111 states have (on average 1.2162162162162162) internal successors, (135), 114 states have internal predecessors, (135), 41 states have call successors, (41), 15 states have call predecessors, (41), 18 states have return successors, (44), 41 states have call predecessors, (44), 40 states have call successors, (44) [2025-03-04 02:53:39,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 220 transitions. [2025-03-04 02:53:39,075 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 220 transitions. Word has length 155 [2025-03-04 02:53:39,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:53:39,079 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 220 transitions. [2025-03-04 02:53:39,080 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), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-04 02:53:39,080 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 220 transitions. [2025-03-04 02:53:39,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 02:53:39,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:53:39,081 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 02:53:39,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:53:39,082 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:53:39,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:53:39,082 INFO L85 PathProgramCache]: Analyzing trace with hash 940218047, now seen corresponding path program 1 times [2025-03-04 02:53:39,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:53:39,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966011416] [2025-03-04 02:53:39,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:39,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:53:42,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 02:53:42,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 02:53:42,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:53:42,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:45,086 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-04 02:53:45,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:53:45,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966011416] [2025-03-04 02:53:45,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966011416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:53:45,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:53:45,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:53:45,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396511512] [2025-03-04 02:53:45,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:53:45,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:53:45,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:53:45,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:53:45,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:53:45,088 INFO L87 Difference]: Start difference. First operand 171 states and 220 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-04 02:53:45,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:53:45,721 INFO L93 Difference]: Finished difference Result 321 states and 422 transitions. [2025-03-04 02:53:45,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:53:45,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) Word has length 161 [2025-03-04 02:53:45,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:53:45,724 INFO L225 Difference]: With dead ends: 321 [2025-03-04 02:53:45,724 INFO L226 Difference]: Without dead ends: 172 [2025-03-04 02:53:45,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:53:45,725 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 3 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 02:53:45,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1149 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 02:53:45,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-04 02:53:45,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2025-03-04 02:53:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 111 states have (on average 1.2072072072072073) internal successors, (134), 114 states have internal predecessors, (134), 41 states have call successors, (41), 15 states have call predecessors, (41), 18 states have return successors, (44), 41 states have call predecessors, (44), 40 states have call successors, (44) [2025-03-04 02:53:45,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 219 transitions. [2025-03-04 02:53:45,739 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 219 transitions. Word has length 161 [2025-03-04 02:53:45,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:53:45,739 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 219 transitions. [2025-03-04 02:53:45,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-04 02:53:45,739 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 219 transitions. [2025-03-04 02:53:45,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 02:53:45,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:53:45,741 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 02:53:45,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:53:45,741 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:53:45,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:53:45,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1176499294, now seen corresponding path program 1 times [2025-03-04 02:53:45,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:53:45,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620213110] [2025-03-04 02:53:45,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:45,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:53:49,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 02:53:49,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 02:53:49,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:53:49,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:50,556 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-04 02:53:50,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:53:50,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620213110] [2025-03-04 02:53:50,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620213110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:53:50,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:53:50,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:53:50,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186805156] [2025-03-04 02:53:50,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:53:50,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:53:50,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:53:50,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:53:50,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:53:50,558 INFO L87 Difference]: Start difference. First operand 171 states and 219 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 4 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-04 02:53:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:53:52,024 INFO L93 Difference]: Finished difference Result 261 states and 338 transitions. [2025-03-04 02:53:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:53:52,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 4 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 168 [2025-03-04 02:53:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:53:52,026 INFO L225 Difference]: With dead ends: 261 [2025-03-04 02:53:52,026 INFO L226 Difference]: Without dead ends: 173 [2025-03-04 02:53:52,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:53:52,027 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 48 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 02:53:52,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1003 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 02:53:52,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-04 02:53:52,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2025-03-04 02:53:52,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 110 states have (on average 1.2) internal successors, (132), 112 states have internal predecessors, (132), 41 states have call successors, (41), 15 states have call predecessors, (41), 17 states have return successors, (42), 41 states have call predecessors, (42), 40 states have call successors, (42) [2025-03-04 02:53:52,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 215 transitions. [2025-03-04 02:53:52,036 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 215 transitions. Word has length 168 [2025-03-04 02:53:52,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:53:52,036 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 215 transitions. [2025-03-04 02:53:52,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 4 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-04 02:53:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 215 transitions. [2025-03-04 02:53:52,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-04 02:53:52,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:53:52,039 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 02:53:52,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:53:52,039 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:53:52,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:53:52,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1501708106, now seen corresponding path program 1 times [2025-03-04 02:53:52,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:53:52,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414069705] [2025-03-04 02:53:52,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:52,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:53:55,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 02:53:55,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 02:53:55,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:53:55,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-04 02:53:57,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:53:57,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414069705] [2025-03-04 02:53:57,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414069705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:53:57,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430102763] [2025-03-04 02:53:57,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:57,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:53:57,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:53:57,295 INFO L229 MonitoredProcess]: Starting monitored process 4 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:53:57,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:54:01,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 02:54:02,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 02:54:02,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:02,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:54:02,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 4526 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 02:54:02,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:54:03,931 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-04 02:54:03,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:54:03,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430102763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:54:03,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:54:03,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2025-03-04 02:54:03,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289839047] [2025-03-04 02:54:03,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:54:03,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:54:03,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:54:03,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:54:03,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:54:03,933 INFO L87 Difference]: Start difference. First operand 169 states and 215 transitions. Second operand has 9 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 02:54:06,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:54:06,640 INFO L93 Difference]: Finished difference Result 189 states and 241 transitions. [2025-03-04 02:54:06,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:54:06,641 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 169 [2025-03-04 02:54:06,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:54:06,642 INFO L225 Difference]: With dead ends: 189 [2025-03-04 02:54:06,643 INFO L226 Difference]: Without dead ends: 187 [2025-03-04 02:54:06,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:54:06,643 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 9 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-04 02:54:06,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1377 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-04 02:54:06,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-04 02:54:06,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 177. [2025-03-04 02:54:06,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 115 states have (on average 1.2) internal successors, (138), 118 states have internal predecessors, (138), 43 states have call successors, (43), 16 states have call predecessors, (43), 18 states have return successors, (44), 42 states have call predecessors, (44), 42 states have call successors, (44) [2025-03-04 02:54:06,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 225 transitions. [2025-03-04 02:54:06,658 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 225 transitions. Word has length 169 [2025-03-04 02:54:06,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:54:06,659 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 225 transitions. [2025-03-04 02:54:06,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 02:54:06,660 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 225 transitions. [2025-03-04 02:54:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-04 02:54:06,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:54:06,661 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 02:54:06,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:54:06,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:54:06,862 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:54:06,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:54:06,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1630790825, now seen corresponding path program 1 times [2025-03-04 02:54:06,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:54:06,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273412703] [2025-03-04 02:54:06,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:54:06,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:54:10,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 02:54:11,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 02:54:11,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:11,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:54:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-03-04 02:54:12,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:54:12,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273412703] [2025-03-04 02:54:12,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273412703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:54:12,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:54:12,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:54:12,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636038003] [2025-03-04 02:54:12,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:54:12,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:54:12,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:54:12,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:54:12,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:54:12,145 INFO L87 Difference]: Start difference. First operand 177 states and 225 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 02:54:12,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:54:12,642 INFO L93 Difference]: Finished difference Result 261 states and 335 transitions. [2025-03-04 02:54:12,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:54:12,643 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 169 [2025-03-04 02:54:12,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:54:12,645 INFO L225 Difference]: With dead ends: 261 [2025-03-04 02:54:12,646 INFO L226 Difference]: Without dead ends: 187 [2025-03-04 02:54:12,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:54:12,646 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 13 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 02:54:12,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 594 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 02:54:12,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-04 02:54:12,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 176. [2025-03-04 02:54:12,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 115 states have (on average 1.191304347826087) internal successors, (137), 117 states have internal predecessors, (137), 42 states have call successors, (42), 16 states have call predecessors, (42), 18 states have return successors, (43), 42 states have call predecessors, (43), 41 states have call successors, (43) [2025-03-04 02:54:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 222 transitions. [2025-03-04 02:54:12,659 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 222 transitions. Word has length 169 [2025-03-04 02:54:12,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:54:12,660 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 222 transitions. [2025-03-04 02:54:12,660 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 02:54:12,660 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 222 transitions. [2025-03-04 02:54:12,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 02:54:12,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:54:12,662 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 02:54:12,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:54:12,662 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:54:12,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:54:12,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1531229723, now seen corresponding path program 1 times [2025-03-04 02:54:12,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:54:12,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519753734] [2025-03-04 02:54:12,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:54:12,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms