./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b6a7e09bdf002daf4e1e371c35be311dd644a61b41d9b32022b9ee835751b90 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:42:20,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:42:20,838 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 08:42:20,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:42:20,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:42:20,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:42:20,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:42:20,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:42:20,868 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:42:20,868 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:42:20,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:42:20,869 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:42:20,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:42:20,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:42:20,869 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:42:20,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:42:20,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:42:20,869 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:42:20,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:42:20,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:42:20,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:42:20,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:42:20,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:42:20,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:42:20,870 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:42:20,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:42:20,870 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:42:20,870 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:42:20,870 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:42:20,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:42:20,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:42:20,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:42:20,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:42:20,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:42:20,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:42:20,871 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:42:20,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:42:20,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:42:20,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:42:20,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:42:20,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:42:20,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:42:20,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:42:20,872 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3b6a7e09bdf002daf4e1e371c35be311dd644a61b41d9b32022b9ee835751b90 [2025-02-06 08:42:21,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:42:21,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:42:21,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:42:21,126 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:42:21,126 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:42:21,128 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-1.i [2025-02-06 08:42:22,299 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36fd28f6d/b425da9da34a42acb3ff19ba026f9345/FLAGefa86ddb0 [2025-02-06 08:42:22,633 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:42:22,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-1.i [2025-02-06 08:42:22,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36fd28f6d/b425da9da34a42acb3ff19ba026f9345/FLAGefa86ddb0 [2025-02-06 08:42:22,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36fd28f6d/b425da9da34a42acb3ff19ba026f9345 [2025-02-06 08:42:22,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:42:22,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:42:22,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:42:22,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:42:22,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:42:22,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:42:22" (1/1) ... [2025-02-06 08:42:22,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19df131b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:22, skipping insertion in model container [2025-02-06 08:42:22,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:42:22" (1/1) ... [2025-02-06 08:42:22,921 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:42:23,188 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-1.i[33021,33034] [2025-02-06 08:42:23,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-1.i[45234,45247] [2025-02-06 08:42:23,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:42:23,284 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:42:23,310 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-1.i[33021,33034] [2025-02-06 08:42:23,369 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-1.i[45234,45247] [2025-02-06 08:42:23,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:42:23,394 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:42:23,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:23 WrapperNode [2025-02-06 08:42:23,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:42:23,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:42:23,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:42:23,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:42:23,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:23" (1/1) ... [2025-02-06 08:42:23,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:23" (1/1) ... [2025-02-06 08:42:23,464 INFO L138 Inliner]: procedures = 177, calls = 289, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1381 [2025-02-06 08:42:23,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:42:23,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:42:23,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:42:23,465 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:42:23,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:23" (1/1) ... [2025-02-06 08:42:23,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:23" (1/1) ... [2025-02-06 08:42:23,478 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:23" (1/1) ... [2025-02-06 08:42:23,531 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2025-02-06 08:42:23,532 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:23" (1/1) ... [2025-02-06 08:42:23,532 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:23" (1/1) ... [2025-02-06 08:42:23,553 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:23" (1/1) ... [2025-02-06 08:42:23,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:23" (1/1) ... [2025-02-06 08:42:23,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:23" (1/1) ... [2025-02-06 08:42:23,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:23" (1/1) ... [2025-02-06 08:42:23,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:42:23,566 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:42:23,567 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:42:23,567 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:42:23,567 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:23" (1/1) ... [2025-02-06 08:42:23,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:42:23,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:42:23,598 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 08:42:23,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 08:42:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:42:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:42:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 08:42:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 08:42:23,616 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 08:42:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:42:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:42:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 08:42:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 08:42:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 08:42:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 08:42:23,617 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 08:42:23,617 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 08:42:23,617 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 08:42:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2025-02-06 08:42:23,617 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2025-02-06 08:42:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:42:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:42:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:42:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:42:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 08:42:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:42:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:42:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:42:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 08:42:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:42:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:42:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:42:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 08:42:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:42:23,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:42:23,762 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:42:23,764 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:42:24,805 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L763: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 08:42:24,890 INFO L? ?]: Removed 328 outVars from TransFormulas that were not future-live. [2025-02-06 08:42:24,890 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:42:24,933 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:42:24,935 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 08:42:24,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:42:24 BoogieIcfgContainer [2025-02-06 08:42:24,935 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:42:24,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:42:24,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:42:24,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:42:24,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:42:22" (1/3) ... [2025-02-06 08:42:24,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f88acab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:42:24, skipping insertion in model container [2025-02-06 08:42:24,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:23" (2/3) ... [2025-02-06 08:42:24,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f88acab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:42:24, skipping insertion in model container [2025-02-06 08:42:24,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:42:24" (3/3) ... [2025-02-06 08:42:24,945 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test8-1.i [2025-02-06 08:42:24,957 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:42:24,959 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test8-1.i that has 6 procedures, 440 locations, 1 initial locations, 37 loop locations, and 2 error locations. [2025-02-06 08:42:25,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:42:25,027 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;@63af411e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:42:25,028 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 08:42:25,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 432 states, 406 states have (on average 1.6231527093596059) internal successors, (659), 423 states have internal predecessors, (659), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 08:42:25,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 08:42:25,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:42:25,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:42:25,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:42:25,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:42:25,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1638663365, now seen corresponding path program 1 times [2025-02-06 08:42:25,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:42:25,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924379616] [2025-02-06 08:42:25,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:25,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:42:25,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 08:42:25,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 08:42:25,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:25,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:25,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:42:25,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:42:25,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924379616] [2025-02-06 08:42:25,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924379616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:42:25,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:42:25,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:42:25,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522737882] [2025-02-06 08:42:25,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:42:25,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:42:25,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:42:25,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:42:25,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:42:25,183 INFO L87 Difference]: Start difference. First operand has 432 states, 406 states have (on average 1.6231527093596059) internal successors, (659), 423 states have internal predecessors, (659), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:42:25,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:42:25,290 INFO L93 Difference]: Finished difference Result 862 states and 1413 transitions. [2025-02-06 08:42:25,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:42:25,292 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 08:42:25,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:42:25,300 INFO L225 Difference]: With dead ends: 862 [2025-02-06 08:42:25,301 INFO L226 Difference]: Without dead ends: 428 [2025-02-06 08:42:25,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:42:25,309 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:42:25,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 593 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:42:25,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-02-06 08:42:25,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2025-02-06 08:42:25,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 403 states have (on average 1.466501240694789) internal successors, (591), 419 states have internal predecessors, (591), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 08:42:25,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 631 transitions. [2025-02-06 08:42:25,356 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 631 transitions. Word has length 9 [2025-02-06 08:42:25,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:42:25,358 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 631 transitions. [2025-02-06 08:42:25,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:42:25,358 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2025-02-06 08:42:25,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 08:42:25,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:42:25,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:42:25,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:42:25,361 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:42:25,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:42:25,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1415174223, now seen corresponding path program 1 times [2025-02-06 08:42:25,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:42:25,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714159191] [2025-02-06 08:42:25,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:25,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:42:25,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 08:42:25,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 08:42:25,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:25,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:25,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:42:25,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:42:25,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714159191] [2025-02-06 08:42:25,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714159191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:42:25,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:42:25,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:42:25,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470094865] [2025-02-06 08:42:25,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:42:25,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:42:25,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:42:25,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:42:25,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:42:25,751 INFO L87 Difference]: Start difference. First operand 428 states and 631 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:42:25,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:42:25,966 INFO L93 Difference]: Finished difference Result 1036 states and 1528 transitions. [2025-02-06 08:42:25,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:42:25,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-06 08:42:25,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:42:25,970 INFO L225 Difference]: With dead ends: 1036 [2025-02-06 08:42:25,970 INFO L226 Difference]: Without dead ends: 809 [2025-02-06 08:42:25,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:42:25,972 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 543 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1702 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:42:25,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1702 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:42:25,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-02-06 08:42:26,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 430. [2025-02-06 08:42:26,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 405 states have (on average 1.4641975308641975) internal successors, (593), 421 states have internal predecessors, (593), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 08:42:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 633 transitions. [2025-02-06 08:42:26,003 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 633 transitions. Word has length 63 [2025-02-06 08:42:26,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:42:26,008 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 633 transitions. [2025-02-06 08:42:26,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:42:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 633 transitions. [2025-02-06 08:42:26,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 08:42:26,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:42:26,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:42:26,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:42:26,013 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:42:26,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:42:26,013 INFO L85 PathProgramCache]: Analyzing trace with hash 44923525, now seen corresponding path program 1 times [2025-02-06 08:42:26,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:42:26,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857623001] [2025-02-06 08:42:26,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:26,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:42:26,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 08:42:26,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 08:42:26,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:26,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:26,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:42:26,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:42:26,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857623001] [2025-02-06 08:42:26,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857623001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:42:26,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:42:26,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:42:26,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674814995] [2025-02-06 08:42:26,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:42:26,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:42:26,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:42:26,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:42:26,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:42:26,309 INFO L87 Difference]: Start difference. First operand 430 states and 633 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:42:26,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:42:26,456 INFO L93 Difference]: Finished difference Result 814 states and 1196 transitions. [2025-02-06 08:42:26,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:42:26,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-06 08:42:26,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:42:26,459 INFO L225 Difference]: With dead ends: 814 [2025-02-06 08:42:26,460 INFO L226 Difference]: Without dead ends: 388 [2025-02-06 08:42:26,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:42:26,462 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 30 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:42:26,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1472 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:42:26,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-02-06 08:42:26,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2025-02-06 08:42:26,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 363 states have (on average 1.421487603305785) internal successors, (516), 379 states have internal predecessors, (516), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 08:42:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 556 transitions. [2025-02-06 08:42:26,474 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 556 transitions. Word has length 84 [2025-02-06 08:42:26,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:42:26,474 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 556 transitions. [2025-02-06 08:42:26,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:42:26,474 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 556 transitions. [2025-02-06 08:42:26,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 08:42:26,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:42:26,475 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:42:26,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:42:26,476 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:42:26,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:42:26,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1427670207, now seen corresponding path program 1 times [2025-02-06 08:42:26,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:42:26,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978114572] [2025-02-06 08:42:26,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:26,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:42:26,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 08:42:26,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 08:42:26,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:26,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:26,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:42:26,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:42:26,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978114572] [2025-02-06 08:42:26,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978114572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:42:26,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:42:26,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:42:26,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961590195] [2025-02-06 08:42:26,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:42:26,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:42:26,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:42:26,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:42:26,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:42:26,651 INFO L87 Difference]: Start difference. First operand 388 states and 556 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:42:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:42:26,837 INFO L93 Difference]: Finished difference Result 1022 states and 1468 transitions. [2025-02-06 08:42:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:42:26,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-06 08:42:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:42:26,843 INFO L225 Difference]: With dead ends: 1022 [2025-02-06 08:42:26,843 INFO L226 Difference]: Without dead ends: 638 [2025-02-06 08:42:26,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:42:26,845 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 294 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:42:26,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1173 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:42:26,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-02-06 08:42:26,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 635. [2025-02-06 08:42:26,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 609 states have (on average 1.4285714285714286) internal successors, (870), 625 states have internal predecessors, (870), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 08:42:26,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 912 transitions. [2025-02-06 08:42:26,867 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 912 transitions. Word has length 84 [2025-02-06 08:42:26,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:42:26,868 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 912 transitions. [2025-02-06 08:42:26,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:42:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 912 transitions. [2025-02-06 08:42:26,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 08:42:26,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:42:26,870 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:42:26,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:42:26,871 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:42:26,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:42:26,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1726130888, now seen corresponding path program 1 times [2025-02-06 08:42:26,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:42:26,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046730683] [2025-02-06 08:42:26,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:26,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:42:26,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 08:42:27,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 08:42:27,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:27,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:42:27,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:42:27,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046730683] [2025-02-06 08:42:27,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046730683] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:42:27,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832271114] [2025-02-06 08:42:27,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:27,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:42:27,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:42:27,258 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:42:27,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 08:42:27,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 08:42:27,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 08:42:27,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:27,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:27,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 08:42:27,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:42:27,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 08:42:27,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-02-06 08:42:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:42:28,194 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:42:28,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832271114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:42:28,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:42:28,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-06 08:42:28,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311653928] [2025-02-06 08:42:28,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:42:28,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 08:42:28,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:42:28,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 08:42:28,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 08:42:28,196 INFO L87 Difference]: Start difference. First operand 635 states and 912 transitions. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:42:30,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:42:30,247 INFO L93 Difference]: Finished difference Result 1523 states and 2189 transitions. [2025-02-06 08:42:30,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 08:42:30,248 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2025-02-06 08:42:30,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:42:30,252 INFO L225 Difference]: With dead ends: 1523 [2025-02-06 08:42:30,252 INFO L226 Difference]: Without dead ends: 931 [2025-02-06 08:42:30,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-06 08:42:30,253 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 586 mSDsluCounter, 2582 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 3080 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 08:42:30,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 3080 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 08:42:30,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-06 08:42:30,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 635. [2025-02-06 08:42:30,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 609 states have (on average 1.4269293924466337) internal successors, (869), 625 states have internal predecessors, (869), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 08:42:30,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 911 transitions. [2025-02-06 08:42:30,279 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 911 transitions. Word has length 99 [2025-02-06 08:42:30,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:42:30,279 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 911 transitions. [2025-02-06 08:42:30,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:42:30,279 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 911 transitions. [2025-02-06 08:42:30,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 08:42:30,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:42:30,281 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:42:30,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 08:42:30,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:42:30,482 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:42:30,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:42:30,482 INFO L85 PathProgramCache]: Analyzing trace with hash -463371583, now seen corresponding path program 1 times [2025-02-06 08:42:30,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:42:30,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194607558] [2025-02-06 08:42:30,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:30,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:42:30,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 08:42:30,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 08:42:30,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:30,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:42:30,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:42:30,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194607558] [2025-02-06 08:42:30,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194607558] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:42:30,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10894245] [2025-02-06 08:42:30,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:30,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:42:30,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:42:30,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:42:30,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 08:42:30,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 08:42:31,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 08:42:31,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:31,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:31,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 08:42:31,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:42:31,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 08:42:31,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-02-06 08:42:31,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:42:31,615 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:42:31,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10894245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:42:31,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:42:31,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-02-06 08:42:31,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255969409] [2025-02-06 08:42:31,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:42:31,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 08:42:31,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:42:31,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 08:42:31,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-02-06 08:42:31,616 INFO L87 Difference]: Start difference. First operand 635 states and 911 transitions. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:42:32,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:42:32,942 INFO L93 Difference]: Finished difference Result 1538 states and 2209 transitions. [2025-02-06 08:42:32,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 08:42:32,942 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-02-06 08:42:32,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:42:32,946 INFO L225 Difference]: With dead ends: 1538 [2025-02-06 08:42:32,947 INFO L226 Difference]: Without dead ends: 951 [2025-02-06 08:42:32,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-02-06 08:42:32,950 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 647 mSDsluCounter, 2662 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 3156 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:42:32,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 3156 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 08:42:32,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-02-06 08:42:32,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 651. [2025-02-06 08:42:32,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 625 states have (on average 1.4224) internal successors, (889), 641 states have internal predecessors, (889), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 08:42:32,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 931 transitions. [2025-02-06 08:42:32,974 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 931 transitions. Word has length 100 [2025-02-06 08:42:32,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:42:32,974 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 931 transitions. [2025-02-06 08:42:32,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:42:32,974 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 931 transitions. [2025-02-06 08:42:32,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 08:42:32,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:42:32,975 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:42:32,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 08:42:33,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:42:33,179 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:42:33,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:42:33,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1536892849, now seen corresponding path program 1 times [2025-02-06 08:42:33,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:42:33,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489122389] [2025-02-06 08:42:33,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:33,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:42:33,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 08:42:33,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 08:42:33,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:33,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:33,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:42:33,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:42:33,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489122389] [2025-02-06 08:42:33,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489122389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:42:33,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:42:33,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:42:33,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248122909] [2025-02-06 08:42:33,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:42:33,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:42:33,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:42:33,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:42:33,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:42:33,457 INFO L87 Difference]: Start difference. First operand 651 states and 931 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:42:33,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:42:33,800 INFO L93 Difference]: Finished difference Result 1255 states and 1808 transitions. [2025-02-06 08:42:33,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:42:33,801 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-02-06 08:42:33,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:42:33,804 INFO L225 Difference]: With dead ends: 1255 [2025-02-06 08:42:33,804 INFO L226 Difference]: Without dead ends: 661 [2025-02-06 08:42:33,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:42:33,805 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 14 mSDsluCounter, 2199 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2696 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:42:33,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2696 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:42:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-02-06 08:42:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 659. [2025-02-06 08:42:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 633 states have (on average 1.4202211690363349) internal successors, (899), 649 states have internal predecessors, (899), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 08:42:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 941 transitions. [2025-02-06 08:42:33,821 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 941 transitions. Word has length 101 [2025-02-06 08:42:33,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:42:33,821 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 941 transitions. [2025-02-06 08:42:33,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:42:33,821 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 941 transitions. [2025-02-06 08:42:33,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 08:42:33,822 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:42:33,822 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:42:33,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:42:33,822 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:42:33,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:42:33,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1269852427, now seen corresponding path program 1 times [2025-02-06 08:42:33,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:42:33,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247091889] [2025-02-06 08:42:33,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:33,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:42:33,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 08:42:33,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 08:42:33,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:33,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:42:34,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:42:34,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247091889] [2025-02-06 08:42:34,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247091889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:42:34,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:42:34,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:42:34,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070295209] [2025-02-06 08:42:34,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:42:34,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:42:34,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:42:34,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:42:34,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:42:34,082 INFO L87 Difference]: Start difference. First operand 659 states and 941 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:42:34,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:42:34,308 INFO L93 Difference]: Finished difference Result 1270 states and 1828 transitions. [2025-02-06 08:42:34,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:42:34,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-02-06 08:42:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:42:34,311 INFO L225 Difference]: With dead ends: 1270 [2025-02-06 08:42:34,311 INFO L226 Difference]: Without dead ends: 665 [2025-02-06 08:42:34,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:42:34,313 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 9 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:42:34,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1848 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:42:34,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-02-06 08:42:34,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2025-02-06 08:42:34,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 639 states have (on average 1.4162754303599374) internal successors, (905), 655 states have internal predecessors, (905), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 08:42:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 947 transitions. [2025-02-06 08:42:34,332 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 947 transitions. Word has length 101 [2025-02-06 08:42:34,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:42:34,332 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 947 transitions. [2025-02-06 08:42:34,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:42:34,333 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 947 transitions. [2025-02-06 08:42:34,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 08:42:34,333 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:42:34,333 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:42:34,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 08:42:34,333 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:42:34,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:42:34,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1329970266, now seen corresponding path program 1 times [2025-02-06 08:42:34,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:42:34,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312473878] [2025-02-06 08:42:34,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:34,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:42:34,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 08:42:34,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 08:42:34,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:34,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:34,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:42:34,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:42:34,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312473878] [2025-02-06 08:42:34,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312473878] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:42:34,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646982244] [2025-02-06 08:42:34,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:34,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:42:34,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:42:34,600 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:42:34,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 08:42:34,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 08:42:34,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 08:42:34,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:34,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:34,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 08:42:34,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:42:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:42:34,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:42:34,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646982244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:42:34,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:42:34,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-06 08:42:34,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499724228] [2025-02-06 08:42:34,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:42:34,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:42:34,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:42:34,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:42:34,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:42:34,926 INFO L87 Difference]: Start difference. First operand 665 states and 947 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:42:35,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:42:35,257 INFO L93 Difference]: Finished difference Result 1286 states and 1845 transitions. [2025-02-06 08:42:35,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 08:42:35,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-02-06 08:42:35,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:42:35,260 INFO L225 Difference]: With dead ends: 1286 [2025-02-06 08:42:35,260 INFO L226 Difference]: Without dead ends: 671 [2025-02-06 08:42:35,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 08:42:35,263 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 42 mSDsluCounter, 2219 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:42:35,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 2717 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:42:35,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-02-06 08:42:35,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 653. [2025-02-06 08:42:35,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 627 states have (on average 1.4146730462519936) internal successors, (887), 643 states have internal predecessors, (887), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 08:42:35,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 929 transitions. [2025-02-06 08:42:35,283 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 929 transitions. Word has length 102 [2025-02-06 08:42:35,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:42:35,284 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 929 transitions. [2025-02-06 08:42:35,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:42:35,284 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 929 transitions. [2025-02-06 08:42:35,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 08:42:35,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:42:35,286 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:42:35,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 08:42:35,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:42:35,487 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:42:35,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:42:35,488 INFO L85 PathProgramCache]: Analyzing trace with hash 850465426, now seen corresponding path program 1 times [2025-02-06 08:42:35,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:42:35,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961346717] [2025-02-06 08:42:35,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:35,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:42:35,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 08:42:35,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 08:42:35,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:35,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:42:35,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:42:35,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961346717] [2025-02-06 08:42:35,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961346717] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:42:35,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902228648] [2025-02-06 08:42:35,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:35,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:42:35,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:42:35,731 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:42:35,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 08:42:35,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 08:42:36,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 08:42:36,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:36,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:36,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 08:42:36,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:42:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:42:53,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:42:53,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902228648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:42:53,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:42:53,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-06 08:42:53,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385449427] [2025-02-06 08:42:53,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:42:53,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:42:53,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:42:53,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:42:53,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:42:53,690 INFO L87 Difference]: Start difference. First operand 653 states and 929 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:42:57,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 08:43:00,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 08:43:04,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 08:43:05,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 08:43:07,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 08:43:08,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 08:43:12,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 08:43:17,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 08:43:17,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:43:17,514 INFO L93 Difference]: Finished difference Result 1254 states and 1800 transitions. [2025-02-06 08:43:17,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:43:17,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-02-06 08:43:17,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:43:17,517 INFO L225 Difference]: With dead ends: 1254 [2025-02-06 08:43:17,517 INFO L226 Difference]: Without dead ends: 663 [2025-02-06 08:43:17,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:43:17,518 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 12 mSDsluCounter, 2200 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2702 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.8s IncrementalHoareTripleChecker+Time [2025-02-06 08:43:17,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2702 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 570 Invalid, 3 Unknown, 0 Unchecked, 23.8s Time] [2025-02-06 08:43:17,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2025-02-06 08:43:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 653. [2025-02-06 08:43:17,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 627 states have (on average 1.4146730462519936) internal successors, (887), 643 states have internal predecessors, (887), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 08:43:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 929 transitions. [2025-02-06 08:43:17,538 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 929 transitions. Word has length 102 [2025-02-06 08:43:17,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:43:17,539 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 929 transitions. [2025-02-06 08:43:17,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:43:17,539 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 929 transitions. [2025-02-06 08:43:17,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 08:43:17,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:43:17,540 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:43:17,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 08:43:17,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 08:43:17,741 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:43:17,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:43:17,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1435791862, now seen corresponding path program 1 times [2025-02-06 08:43:17,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:43:17,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901463114] [2025-02-06 08:43:17,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:43:17,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:43:17,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 08:43:17,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 08:43:17,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:43:17,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:43:18,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:43:18,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:43:18,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901463114] [2025-02-06 08:43:18,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901463114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:43:18,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:43:18,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 08:43:18,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328869371] [2025-02-06 08:43:18,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:43:18,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:43:18,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:43:18,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:43:18,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:43:18,088 INFO L87 Difference]: Start difference. First operand 653 states and 929 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:43:18,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:43:18,614 INFO L93 Difference]: Finished difference Result 1276 states and 1829 transitions. [2025-02-06 08:43:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:43:18,615 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-02-06 08:43:18,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:43:18,617 INFO L225 Difference]: With dead ends: 1276 [2025-02-06 08:43:18,618 INFO L226 Difference]: Without dead ends: 685 [2025-02-06 08:43:18,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:43:18,619 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 23 mSDsluCounter, 3157 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3660 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:43:18,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3660 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:43:18,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-02-06 08:43:18,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 673. [2025-02-06 08:43:18,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 647 states have (on average 1.4080370942812983) internal successors, (911), 663 states have internal predecessors, (911), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 08:43:18,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 953 transitions. [2025-02-06 08:43:18,635 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 953 transitions. Word has length 104 [2025-02-06 08:43:18,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:43:18,636 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 953 transitions. [2025-02-06 08:43:18,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:43:18,636 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 953 transitions. [2025-02-06 08:43:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 08:43:18,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:43:18,637 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:43:18,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 08:43:18,638 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:43:18,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:43:18,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1267195573, now seen corresponding path program 1 times [2025-02-06 08:43:18,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:43:18,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293570775] [2025-02-06 08:43:18,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:43:18,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:43:18,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 08:43:18,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 08:43:18,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:43:18,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:43:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:43:18,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:43:18,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293570775] [2025-02-06 08:43:18,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293570775] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:43:18,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149396120] [2025-02-06 08:43:18,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:43:18,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:43:18,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:43:18,875 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:43:18,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 08:43:19,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 08:43:19,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 08:43:19,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:43:19,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:43:19,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 08:43:19,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:43:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:43:20,666 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:43:20,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149396120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:43:20,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:43:20,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-06 08:43:20,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413658530] [2025-02-06 08:43:20,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:43:20,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 08:43:20,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:43:20,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 08:43:20,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-02-06 08:43:20,667 INFO L87 Difference]: Start difference. First operand 673 states and 953 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:43:21,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:43:22,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:43:22,464 INFO L93 Difference]: Finished difference Result 1284 states and 1831 transitions. [2025-02-06 08:43:22,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:43:22,465 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-02-06 08:43:22,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:43:22,468 INFO L225 Difference]: With dead ends: 1284 [2025-02-06 08:43:22,468 INFO L226 Difference]: Without dead ends: 683 [2025-02-06 08:43:22,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-02-06 08:43:22,470 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 11 mSDsluCounter, 3942 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4443 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 08:43:22,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 4443 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 08:43:22,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-02-06 08:43:22,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 679. [2025-02-06 08:43:22,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 653 states have (on average 1.4042879019908117) internal successors, (917), 669 states have internal predecessors, (917), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 08:43:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 959 transitions. [2025-02-06 08:43:22,486 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 959 transitions. Word has length 104 [2025-02-06 08:43:22,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:43:22,486 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 959 transitions. [2025-02-06 08:43:22,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:43:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 959 transitions. [2025-02-06 08:43:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 08:43:22,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:43:22,487 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:43:22,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 08:43:22,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 08:43:22,689 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:43:22,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:43:22,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1490938833, now seen corresponding path program 1 times [2025-02-06 08:43:22,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:43:22,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448606821] [2025-02-06 08:43:22,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:43:22,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:43:22,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 08:43:22,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 08:43:22,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:43:22,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:43:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:43:22,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:43:22,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448606821] [2025-02-06 08:43:22,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448606821] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:43:22,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802755545] [2025-02-06 08:43:22,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:43:22,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:43:22,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:43:22,896 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:43:22,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 08:43:23,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 08:43:23,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 08:43:23,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:43:23,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:43:23,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 08:43:23,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:43:23,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:43:23,343 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:43:23,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802755545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:43:23,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:43:23,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-06 08:43:23,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849646341] [2025-02-06 08:43:23,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:43:23,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:43:23,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:43:23,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:43:23,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:43:23,345 INFO L87 Difference]: Start difference. First operand 679 states and 959 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:43:23,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:43:23,787 INFO L93 Difference]: Finished difference Result 1293 states and 1845 transitions. [2025-02-06 08:43:23,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:43:23,788 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-02-06 08:43:23,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:43:23,790 INFO L225 Difference]: With dead ends: 1293 [2025-02-06 08:43:23,790 INFO L226 Difference]: Without dead ends: 689 [2025-02-06 08:43:23,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:43:23,791 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 10 mSDsluCounter, 2200 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2702 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:43:23,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2702 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:43:23,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-02-06 08:43:23,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 679. [2025-02-06 08:43:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 653 states have (on average 1.4042879019908117) internal successors, (917), 669 states have internal predecessors, (917), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 08:43:23,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 959 transitions. [2025-02-06 08:43:23,811 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 959 transitions. Word has length 104 [2025-02-06 08:43:23,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:43:23,812 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 959 transitions. [2025-02-06 08:43:23,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:43:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 959 transitions. [2025-02-06 08:43:23,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 08:43:23,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:43:23,813 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:43:23,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 08:43:24,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 08:43:24,014 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:43:24,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:43:24,014 INFO L85 PathProgramCache]: Analyzing trace with hash -2135302961, now seen corresponding path program 1 times [2025-02-06 08:43:24,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:43:24,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748264623] [2025-02-06 08:43:24,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:43:24,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:43:24,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 08:43:24,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 08:43:24,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:43:24,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:43:24,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:43:24,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:43:24,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748264623] [2025-02-06 08:43:24,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748264623] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:43:24,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863757462] [2025-02-06 08:43:24,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:43:24,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:43:24,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:43:24,222 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:43:24,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 08:43:24,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 08:43:24,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 08:43:24,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:43:24,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:43:24,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 08:43:24,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:43:24,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:43:24,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:43:24,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863757462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:43:24,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:43:24,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-06 08:43:24,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000960546] [2025-02-06 08:43:24,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:43:24,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:43:24,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:43:24,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:43:24,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:43:24,637 INFO L87 Difference]: Start difference. First operand 679 states and 959 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 08:43:24,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:43:24,741 INFO L93 Difference]: Finished difference Result 1249 states and 1780 transitions. [2025-02-06 08:43:24,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:43:24,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2025-02-06 08:43:24,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:43:24,744 INFO L225 Difference]: With dead ends: 1249 [2025-02-06 08:43:24,747 INFO L226 Difference]: Without dead ends: 682 [2025-02-06 08:43:24,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:43:24,749 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 0 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:43:24,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1529 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:43:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-02-06 08:43:24,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2025-02-06 08:43:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 655 states have (on average 1.4045801526717556) internal successors, (920), 672 states have internal predecessors, (920), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-02-06 08:43:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 963 transitions. [2025-02-06 08:43:24,767 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 963 transitions. Word has length 105 [2025-02-06 08:43:24,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:43:24,767 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 963 transitions. [2025-02-06 08:43:24,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 08:43:24,768 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 963 transitions. [2025-02-06 08:43:24,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 08:43:24,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:43:24,768 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:43:24,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 08:43:24,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:43:24,969 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:43:24,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:43:24,970 INFO L85 PathProgramCache]: Analyzing trace with hash -230943981, now seen corresponding path program 1 times [2025-02-06 08:43:24,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:43:24,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140630741] [2025-02-06 08:43:24,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:43:24,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:43:25,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 08:43:25,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 08:43:25,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:43:25,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:43:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 08:43:25,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:43:25,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140630741] [2025-02-06 08:43:25,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140630741] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:43:25,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011964566] [2025-02-06 08:43:25,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:43:25,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:43:25,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:43:25,348 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:43:25,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 08:43:25,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 08:43:25,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 08:43:25,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:43:25,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:43:25,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 08:43:25,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:43:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 08:43:25,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:43:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 08:43:25,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011964566] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:43:25,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:43:25,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 08:43:25,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836511947] [2025-02-06 08:43:25,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:43:25,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:43:25,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:43:25,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:43:25,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:43:25,890 INFO L87 Difference]: Start difference. First operand 682 states and 963 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 08:43:26,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:43:26,105 INFO L93 Difference]: Finished difference Result 1263 states and 1802 transitions. [2025-02-06 08:43:26,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:43:26,105 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 107 [2025-02-06 08:43:26,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:43:26,108 INFO L225 Difference]: With dead ends: 1263 [2025-02-06 08:43:26,108 INFO L226 Difference]: Without dead ends: 691 [2025-02-06 08:43:26,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-02-06 08:43:26,111 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 5 mSDsluCounter, 2034 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:43:26,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2545 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:43:26,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-02-06 08:43:26,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2025-02-06 08:43:26,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 663 states have (on average 1.405731523378582) internal successors, (932), 680 states have internal predecessors, (932), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (23), 7 states have call predecessors, (23), 21 states have call successors, (23) [2025-02-06 08:43:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 976 transitions. [2025-02-06 08:43:26,132 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 976 transitions. Word has length 107 [2025-02-06 08:43:26,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:43:26,133 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 976 transitions. [2025-02-06 08:43:26,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 08:43:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 976 transitions. [2025-02-06 08:43:26,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 08:43:26,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:43:26,134 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:43:26,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 08:43:26,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 08:43:26,335 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:43:26,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:43:26,335 INFO L85 PathProgramCache]: Analyzing trace with hash 31462031, now seen corresponding path program 2 times [2025-02-06 08:43:26,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:43:26,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988428535] [2025-02-06 08:43:26,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:43:26,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:43:26,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes. [2025-02-06 08:43:26,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 98 of 111 statements. [2025-02-06 08:43:26,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:43:26,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:43:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-06 08:43:26,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:43:26,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988428535] [2025-02-06 08:43:26,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988428535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:43:26,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:43:26,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 08:43:26,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736774636] [2025-02-06 08:43:26,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:43:26,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:43:26,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:43:26,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:43:26,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:43:26,705 INFO L87 Difference]: Start difference. First operand 691 states and 976 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:43:27,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:43:27,344 INFO L93 Difference]: Finished difference Result 1311 states and 1869 transitions. [2025-02-06 08:43:27,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:43:27,345 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 111 [2025-02-06 08:43:27,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:43:27,348 INFO L225 Difference]: With dead ends: 1311 [2025-02-06 08:43:27,348 INFO L226 Difference]: Without dead ends: 705 [2025-02-06 08:43:27,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:43:27,350 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 13 mSDsluCounter, 3537 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4032 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 08:43:27,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4032 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 08:43:27,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-02-06 08:43:27,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 691. [2025-02-06 08:43:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 663 states have (on average 1.405731523378582) internal successors, (932), 680 states have internal predecessors, (932), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (23), 7 states have call predecessors, (23), 21 states have call successors, (23) [2025-02-06 08:43:27,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 976 transitions. [2025-02-06 08:43:27,365 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 976 transitions. Word has length 111 [2025-02-06 08:43:27,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:43:27,365 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 976 transitions. [2025-02-06 08:43:27,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:43:27,366 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 976 transitions. [2025-02-06 08:43:27,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 08:43:27,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:43:27,366 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:43:27,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 08:43:27,367 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:43:27,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:43:27,367 INFO L85 PathProgramCache]: Analyzing trace with hash 420309402, now seen corresponding path program 1 times [2025-02-06 08:43:27,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:43:27,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866823389] [2025-02-06 08:43:27,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:43:27,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:43:27,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 08:43:27,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 08:43:27,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:43:27,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:43:27,647 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 08:43:27,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:43:27,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866823389] [2025-02-06 08:43:27,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866823389] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:43:27,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603918174] [2025-02-06 08:43:27,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:43:27,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:43:27,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:43:27,650 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:43:27,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 08:43:27,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 08:43:28,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 08:43:28,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:43:28,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:43:28,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 08:43:28,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:43:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 08:43:28,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:43:28,218 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 08:43:28,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603918174] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:43:28,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:43:28,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 14 [2025-02-06 08:43:28,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596013632] [2025-02-06 08:43:28,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:43:28,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 08:43:28,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:43:28,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 08:43:28,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-02-06 08:43:28,220 INFO L87 Difference]: Start difference. First operand 691 states and 976 transitions. Second operand has 14 states, 14 states have (on average 8.357142857142858) internal successors, (117), 14 states have internal predecessors, (117), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 08:43:28,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:43:28,558 INFO L93 Difference]: Finished difference Result 1278 states and 1821 transitions. [2025-02-06 08:43:28,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 08:43:28,559 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.357142857142858) internal successors, (117), 14 states have internal predecessors, (117), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-02-06 08:43:28,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:43:28,563 INFO L225 Difference]: With dead ends: 1278 [2025-02-06 08:43:28,563 INFO L226 Difference]: Without dead ends: 697 [2025-02-06 08:43:28,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2025-02-06 08:43:28,565 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 29 mSDsluCounter, 1985 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2486 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:43:28,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2486 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:43:28,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-02-06 08:43:28,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 695. [2025-02-06 08:43:28,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 667 states have (on average 1.406296851574213) internal successors, (938), 684 states have internal predecessors, (938), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-02-06 08:43:28,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 981 transitions. [2025-02-06 08:43:28,582 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 981 transitions. Word has length 111 [2025-02-06 08:43:28,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:43:28,582 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 981 transitions. [2025-02-06 08:43:28,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.357142857142858) internal successors, (117), 14 states have internal predecessors, (117), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 08:43:28,582 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 981 transitions. [2025-02-06 08:43:28,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 08:43:28,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:43:28,583 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:43:28,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 08:43:28,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:43:28,784 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:43:28,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:43:28,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1261425818, now seen corresponding path program 2 times [2025-02-06 08:43:28,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:43:28,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336071761] [2025-02-06 08:43:28,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:43:28,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:43:28,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 115 statements into 2 equivalence classes. [2025-02-06 08:43:28,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 98 of 115 statements. [2025-02-06 08:43:28,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:43:28,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:43:29,328 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-02-06 08:43:29,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:43:29,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336071761] [2025-02-06 08:43:29,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336071761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:43:29,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:43:29,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 08:43:29,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534419914] [2025-02-06 08:43:29,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:43:29,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:43:29,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:43:29,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:43:29,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:43:29,330 INFO L87 Difference]: Start difference. First operand 695 states and 981 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:43:33,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:43:34,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:43:34,317 INFO L93 Difference]: Finished difference Result 1336 states and 1897 transitions. [2025-02-06 08:43:34,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:43:34,321 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 115 [2025-02-06 08:43:34,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:43:34,324 INFO L225 Difference]: With dead ends: 1336 [2025-02-06 08:43:34,324 INFO L226 Difference]: Without dead ends: 721 [2025-02-06 08:43:34,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-06 08:43:34,326 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 41 mSDsluCounter, 3537 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 4045 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-02-06 08:43:34,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 4045 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 957 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-02-06 08:43:34,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-02-06 08:43:34,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 707. [2025-02-06 08:43:34,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 679 states have (on average 1.402061855670103) internal successors, (952), 696 states have internal predecessors, (952), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-02-06 08:43:34,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 995 transitions. [2025-02-06 08:43:34,358 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 995 transitions. Word has length 115 [2025-02-06 08:43:34,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:43:34,358 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 995 transitions. [2025-02-06 08:43:34,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:43:34,358 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 995 transitions. [2025-02-06 08:43:34,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 08:43:34,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:43:34,361 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:43:34,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 08:43:34,361 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:43:34,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:43:34,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1531549433, now seen corresponding path program 1 times [2025-02-06 08:43:34,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:43:34,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355796869] [2025-02-06 08:43:34,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:43:34,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:43:34,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 08:43:34,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 08:43:34,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:43:34,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:43:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 08:43:34,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:43:34,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355796869] [2025-02-06 08:43:34,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355796869] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:43:34,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397022952] [2025-02-06 08:43:34,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:43:34,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:43:34,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:43:34,853 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:43:34,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 08:43:35,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 08:43:35,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 08:43:35,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:43:35,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:43:35,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 08:43:35,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:43:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 22 proven. 37 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 08:43:35,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:43:47,757 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 37 proven. 7 refuted. 3 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 08:43:47,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397022952] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:43:47,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:43:47,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 22 [2025-02-06 08:43:47,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855029789] [2025-02-06 08:43:47,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:43:47,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 08:43:47,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:43:47,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 08:43:47,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=355, Unknown=3, NotChecked=0, Total=462 [2025-02-06 08:43:47,761 INFO L87 Difference]: Start difference. First operand 707 states and 995 transitions. Second operand has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 08:43:48,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:43:48,551 INFO L93 Difference]: Finished difference Result 1311 states and 1862 transitions. [2025-02-06 08:43:48,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 08:43:48,552 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 115 [2025-02-06 08:43:48,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:43:48,554 INFO L225 Difference]: With dead ends: 1311 [2025-02-06 08:43:48,556 INFO L226 Difference]: Without dead ends: 716 [2025-02-06 08:43:48,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=383, Invalid=1174, Unknown=3, NotChecked=0, Total=1560 [2025-02-06 08:43:48,558 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 51 mSDsluCounter, 5934 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 6434 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:43:48,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 6434 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:43:48,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-02-06 08:43:48,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 714. [2025-02-06 08:43:48,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 686 states have (on average 1.403790087463557) internal successors, (963), 703 states have internal predecessors, (963), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-02-06 08:43:48,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1006 transitions. [2025-02-06 08:43:48,576 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1006 transitions. Word has length 115 [2025-02-06 08:43:48,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:43:48,576 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 1006 transitions. [2025-02-06 08:43:48,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 08:43:48,576 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1006 transitions. [2025-02-06 08:43:48,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 08:43:48,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:43:48,577 INFO L218 NwaCegarLoop]: trace histogram [17, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:43:48,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 08:43:48,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:43:48,778 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:43:48,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:43:48,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1122073479, now seen corresponding path program 2 times [2025-02-06 08:43:48,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:43:48,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285196340] [2025-02-06 08:43:48,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:43:48,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:43:48,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-02-06 08:43:48,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 98 of 122 statements. [2025-02-06 08:43:48,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:43:48,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:43:49,101 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-02-06 08:43:49,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:43:49,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285196340] [2025-02-06 08:43:49,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285196340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:43:49,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:43:49,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:43:49,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805943374] [2025-02-06 08:43:49,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:43:49,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:43:49,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:43:49,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:43:49,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:43:49,103 INFO L87 Difference]: Start difference. First operand 714 states and 1006 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:43:49,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:43:49,643 INFO L93 Difference]: Finished difference Result 1374 states and 1952 transitions. [2025-02-06 08:43:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 08:43:49,644 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 122 [2025-02-06 08:43:49,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:43:49,647 INFO L225 Difference]: With dead ends: 1374 [2025-02-06 08:43:49,647 INFO L226 Difference]: Without dead ends: 746 [2025-02-06 08:43:49,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:43:49,648 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 23 mSDsluCounter, 3157 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3656 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:43:49,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3656 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:43:49,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-02-06 08:43:49,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 726. [2025-02-06 08:43:49,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 698 states have (on average 1.3997134670487106) internal successors, (977), 715 states have internal predecessors, (977), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-02-06 08:43:49,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1020 transitions. [2025-02-06 08:43:49,663 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1020 transitions. Word has length 122 [2025-02-06 08:43:49,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:43:49,663 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 1020 transitions. [2025-02-06 08:43:49,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:43:49,663 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1020 transitions. [2025-02-06 08:43:49,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 08:43:49,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:43:49,664 INFO L218 NwaCegarLoop]: trace histogram [17, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:43:49,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 08:43:49,664 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:43:49,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:43:49,665 INFO L85 PathProgramCache]: Analyzing trace with hash 408067671, now seen corresponding path program 1 times [2025-02-06 08:43:49,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:43:49,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667680873] [2025-02-06 08:43:49,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:43:49,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:43:49,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 08:43:49,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 08:43:49,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:43:49,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:43:50,269 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-06 08:43:50,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:43:50,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667680873] [2025-02-06 08:43:50,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667680873] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:43:50,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200696017] [2025-02-06 08:43:50,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:43:50,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:43:50,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:43:50,272 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:43:50,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 08:43:50,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 08:43:51,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 08:43:51,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:43:51,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:43:51,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 171 conjuncts are in the unsatisfiable core [2025-02-06 08:43:51,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:43:51,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 08:43:51,250 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2025-02-06 08:43:51,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2025-02-06 08:43:51,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 08:43:51,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 08:43:51,566 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 08:43:51,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41