./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.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_SFH_test8-2.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 dfe9cedb3fb732c747a1ef802da6fccda86efe7de6f5d2fc74063f23f28dc4dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:54:01,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:54:01,908 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:54:01,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:54:01,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:54:01,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:54:01,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:54:01,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:54:01,927 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:54:01,927 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:54:01,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:54:01,927 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:54:01,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:54:01,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:54:01,928 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:54:01,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:54:01,928 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:54:01,928 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:54:01,928 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:54:01,928 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:54:01,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:54:01,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:54:01,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:54:01,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:54:01,928 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:54:01,930 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:54:01,930 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:54:01,930 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:54:01,930 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:54:01,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:54:01,930 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:54:01,930 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:54:01,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:54:01,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:54:01,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:54:01,931 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:54:01,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:54:01,931 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:54:01,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:54:01,931 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:54:01,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:54:01,932 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:54:01,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:54:01,932 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 -> dfe9cedb3fb732c747a1ef802da6fccda86efe7de6f5d2fc74063f23f28dc4dd [2025-02-06 08:54:02,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:54:02,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:54:02,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:54:02,167 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:54:02,168 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:54:02,169 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_SFH_test8-2.i [2025-02-06 08:54:03,321 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/661b95263/699989393d0f4027a1d1ea1dd9cbf111/FLAG18c62f3b2 [2025-02-06 08:54:03,711 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:54:03,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i [2025-02-06 08:54:03,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/661b95263/699989393d0f4027a1d1ea1dd9cbf111/FLAG18c62f3b2 [2025-02-06 08:54:03,901 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/661b95263/699989393d0f4027a1d1ea1dd9cbf111 [2025-02-06 08:54:03,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:54:03,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:54:03,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:54:03,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:54:03,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:54:03,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:54:03" (1/1) ... [2025-02-06 08:54:03,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c453938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:54:03, skipping insertion in model container [2025-02-06 08:54:03,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:54:03" (1/1) ... [2025-02-06 08:54:03,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:54:04,262 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_SFH_test8-2.i[33021,33034] [2025-02-06 08:54:04,364 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_SFH_test8-2.i[45234,45247] [2025-02-06 08:54:04,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:54:04,401 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:54:04,434 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_SFH_test8-2.i[33021,33034] [2025-02-06 08:54:04,504 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_SFH_test8-2.i[45234,45247] [2025-02-06 08:54:04,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:54:04,546 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:54:04,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:54:04 WrapperNode [2025-02-06 08:54:04,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:54:04,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:54:04,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:54:04,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:54:04,552 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:54:04" (1/1) ... [2025-02-06 08:54:04,571 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:54:04" (1/1) ... [2025-02-06 08:54:04,628 INFO L138 Inliner]: procedures = 177, calls = 340, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1540 [2025-02-06 08:54:04,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:54:04,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:54:04,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:54:04,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:54:04,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:54:04" (1/1) ... [2025-02-06 08:54:04,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:54:04" (1/1) ... [2025-02-06 08:54:04,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:54:04" (1/1) ... [2025-02-06 08:54:04,727 INFO L175 MemorySlicer]: Split 304 memory accesses to 3 slices as follows [2, 268, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2025-02-06 08:54:04,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:54:04" (1/1) ... [2025-02-06 08:54:04,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:54:04" (1/1) ... [2025-02-06 08:54:04,769 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:54:04" (1/1) ... [2025-02-06 08:54:04,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:54:04" (1/1) ... [2025-02-06 08:54:04,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:54:04" (1/1) ... [2025-02-06 08:54:04,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:54:04" (1/1) ... [2025-02-06 08:54:04,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:54:04,782 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:54:04,782 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:54:04,782 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:54:04,783 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:54:04" (1/1) ... [2025-02-06 08:54:04,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:54:04,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:54:04,808 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:54:04,812 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:54:04,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:54:04,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:54:04,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 08:54:04,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 08:54:04,831 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 08:54:04,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:54:04,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:54:04,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 08:54:04,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 08:54:04,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 08:54:04,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 08:54:04,831 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 08:54:04,831 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 08:54:04,831 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 08:54:04,831 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2025-02-06 08:54:04,832 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2025-02-06 08:54:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:54:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:54:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:54:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:54:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 08:54:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:54:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:54:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:54:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 08:54:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:54:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:54:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:54:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 08:54:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:54:04,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:54:05,017 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:54:05,018 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:54:06,396 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:54:06,477 INFO L? ?]: Removed 354 outVars from TransFormulas that were not future-live. [2025-02-06 08:54:06,478 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:54:06,515 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:54:06,516 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 08:54:06,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:54:06 BoogieIcfgContainer [2025-02-06 08:54:06,516 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:54:06,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:54:06,518 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:54:06,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:54:06,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:54:03" (1/3) ... [2025-02-06 08:54:06,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fa8099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:54:06, skipping insertion in model container [2025-02-06 08:54:06,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:54:04" (2/3) ... [2025-02-06 08:54:06,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fa8099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:54:06, skipping insertion in model container [2025-02-06 08:54:06,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:54:06" (3/3) ... [2025-02-06 08:54:06,523 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test8-2.i [2025-02-06 08:54:06,533 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:54:06,534 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test8-2.i that has 6 procedures, 473 locations, 1 initial locations, 42 loop locations, and 2 error locations. [2025-02-06 08:54:06,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:54:06,583 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;@218e3d15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:54:06,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 08:54:06,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 465 states, 439 states have (on average 1.6241457858769932) internal successors, (713), 456 states have internal predecessors, (713), 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:54:06,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 08:54:06,591 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:54:06,591 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:54:06,591 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:54:06,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:54:06,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1998938126, now seen corresponding path program 1 times [2025-02-06 08:54:06,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:54:06,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022512429] [2025-02-06 08:54:06,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:54:06,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:54:06,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 08:54:06,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 08:54:06,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:54:06,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:54:06,716 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:54:06,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:54:06,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022512429] [2025-02-06 08:54:06,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022512429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:54:06,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:54:06,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:54:06,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533491710] [2025-02-06 08:54:06,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:54:06,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:54:06,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:54:06,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:54:06,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:54:06,737 INFO L87 Difference]: Start difference. First operand has 465 states, 439 states have (on average 1.6241457858769932) internal successors, (713), 456 states have internal predecessors, (713), 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:54:06,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:54:06,845 INFO L93 Difference]: Finished difference Result 928 states and 1521 transitions. [2025-02-06 08:54:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:54:06,849 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:54:06,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:54:06,858 INFO L225 Difference]: With dead ends: 928 [2025-02-06 08:54:06,860 INFO L226 Difference]: Without dead ends: 428 [2025-02-06 08:54:06,863 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:54:06,877 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:54:06,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 638 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:54:06,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-02-06 08:54:06,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2025-02-06 08:54:06,927 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:54:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 631 transitions. [2025-02-06 08:54:06,936 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 631 transitions. Word has length 9 [2025-02-06 08:54:06,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:54:06,936 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 631 transitions. [2025-02-06 08:54:06,937 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:54:06,937 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2025-02-06 08:54:06,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 08:54:06,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:54:06,939 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:54:06,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:54:06,940 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:54:06,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:54:06,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2135651290, now seen corresponding path program 1 times [2025-02-06 08:54:06,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:54:06,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583711848] [2025-02-06 08:54:06,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:54:06,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:54:06,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 08:54:06,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 08:54:06,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:54:06,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:54:07,302 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:54:07,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:54:07,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583711848] [2025-02-06 08:54:07,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583711848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:54:07,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:54:07,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:54:07,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233023690] [2025-02-06 08:54:07,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:54:07,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:54:07,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:54:07,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:54:07,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:54:07,303 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:54:07,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:54:07,538 INFO L93 Difference]: Finished difference Result 1036 states and 1528 transitions. [2025-02-06 08:54:07,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:54:07,538 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:54:07,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:54:07,543 INFO L225 Difference]: With dead ends: 1036 [2025-02-06 08:54:07,544 INFO L226 Difference]: Without dead ends: 809 [2025-02-06 08:54:07,545 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:54:07,545 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:54:07,546 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:54:07,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-02-06 08:54:07,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 430. [2025-02-06 08:54:07,576 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:54:07,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 633 transitions. [2025-02-06 08:54:07,579 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 633 transitions. Word has length 63 [2025-02-06 08:54:07,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:54:07,580 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 633 transitions. [2025-02-06 08:54:07,580 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:54:07,581 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 633 transitions. [2025-02-06 08:54:07,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 08:54:07,584 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:54:07,584 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:54:07,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:54:07,584 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:54:07,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:54:07,584 INFO L85 PathProgramCache]: Analyzing trace with hash -967464667, now seen corresponding path program 1 times [2025-02-06 08:54:07,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:54:07,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689696009] [2025-02-06 08:54:07,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:54:07,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:54:07,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 08:54:07,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 08:54:07,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:54:07,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:54:07,842 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:54:07,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:54:07,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689696009] [2025-02-06 08:54:07,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689696009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:54:07,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:54:07,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:54:07,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478404815] [2025-02-06 08:54:07,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:54:07,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:54:07,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:54:07,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:54:07,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:54:07,844 INFO L87 Difference]: Start difference. First operand 430 states and 633 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 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:54:08,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:54:08,019 INFO L93 Difference]: Finished difference Result 814 states and 1196 transitions. [2025-02-06 08:54:08,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:54:08,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 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:54:08,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:54:08,022 INFO L225 Difference]: With dead ends: 814 [2025-02-06 08:54:08,022 INFO L226 Difference]: Without dead ends: 388 [2025-02-06 08:54:08,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:54:08,024 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 12 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1957 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:54:08,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1957 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:54:08,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-02-06 08:54:08,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2025-02-06 08:54:08,034 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:54:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 556 transitions. [2025-02-06 08:54:08,036 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 556 transitions. Word has length 84 [2025-02-06 08:54:08,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:54:08,036 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 556 transitions. [2025-02-06 08:54:08,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 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:54:08,036 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 556 transitions. [2025-02-06 08:54:08,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 08:54:08,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:54:08,038 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:54:08,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:54:08,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:54:08,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:54:08,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1698842977, now seen corresponding path program 1 times [2025-02-06 08:54:08,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:54:08,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765731054] [2025-02-06 08:54:08,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:54:08,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:54:08,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 08:54:08,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 08:54:08,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:54:08,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:54:08,176 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:54:08,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:54:08,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765731054] [2025-02-06 08:54:08,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765731054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:54:08,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:54:08,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:54:08,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051444862] [2025-02-06 08:54:08,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:54:08,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:54:08,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:54:08,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:54:08,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:54:08,178 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:54:08,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:54:08,334 INFO L93 Difference]: Finished difference Result 1022 states and 1468 transitions. [2025-02-06 08:54:08,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:54:08,334 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:54:08,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:54:08,337 INFO L225 Difference]: With dead ends: 1022 [2025-02-06 08:54:08,337 INFO L226 Difference]: Without dead ends: 638 [2025-02-06 08:54:08,338 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:54:08,339 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.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:54:08,339 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.1s Time] [2025-02-06 08:54:08,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-02-06 08:54:08,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 635. [2025-02-06 08:54:08,359 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:54:08,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 912 transitions. [2025-02-06 08:54:08,365 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 912 transitions. Word has length 84 [2025-02-06 08:54:08,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:54:08,366 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 912 transitions. [2025-02-06 08:54:08,366 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:54:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 912 transitions. [2025-02-06 08:54:08,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 08:54:08,369 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:54:08,370 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:54:08,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:54:08,370 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:54:08,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:54:08,370 INFO L85 PathProgramCache]: Analyzing trace with hash 548936911, now seen corresponding path program 1 times [2025-02-06 08:54:08,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:54:08,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798252643] [2025-02-06 08:54:08,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:54:08,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:54:08,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 08:54:08,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 08:54:08,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:54:08,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:54:08,863 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:54:08,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:54:08,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798252643] [2025-02-06 08:54:08,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798252643] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:54:08,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329912577] [2025-02-06 08:54:08,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:54:08,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:54:08,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:54:08,867 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:54:08,868 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:54:09,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 08:54:09,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 08:54:09,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:54:09,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:54:09,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 08:54:09,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:54:09,146 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:54:09,170 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:54:09,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 08:54:09,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2025-02-06 08:54:09,855 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:54:09,856 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:54:09,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329912577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:54:09,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:54:09,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-06 08:54:09,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55559157] [2025-02-06 08:54:09,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:54:09,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 08:54:09,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:54:09,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 08:54:09,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-06 08:54:09,857 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:54:11,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:54:11,415 INFO L93 Difference]: Finished difference Result 1523 states and 2189 transitions. [2025-02-06 08:54:11,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 08:54:11,416 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:54:11,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:54:11,419 INFO L225 Difference]: With dead ends: 1523 [2025-02-06 08:54:11,419 INFO L226 Difference]: Without dead ends: 931 [2025-02-06 08:54:11,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-02-06 08:54:11,420 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 591 mSDsluCounter, 3128 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 3665 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:54:11,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 3665 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 08:54:11,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-06 08:54:11,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 635. [2025-02-06 08:54:11,437 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:54:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 911 transitions. [2025-02-06 08:54:11,439 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 911 transitions. Word has length 99 [2025-02-06 08:54:11,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:54:11,440 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 911 transitions. [2025-02-06 08:54:11,440 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:54:11,440 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 911 transitions. [2025-02-06 08:54:11,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 08:54:11,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:54:11,441 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:54:11,449 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:54:11,641 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:54:11,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:54:11,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:54:11,643 INFO L85 PathProgramCache]: Analyzing trace with hash 305766081, now seen corresponding path program 1 times [2025-02-06 08:54:11,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:54:11,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466963127] [2025-02-06 08:54:11,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:54:11,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:54:11,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 08:54:11,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 08:54:11,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:54:11,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:54:12,109 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:54:12,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:54:12,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466963127] [2025-02-06 08:54:12,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466963127] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:54:12,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322296778] [2025-02-06 08:54:12,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:54:12,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:54:12,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:54:12,112 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:54:12,113 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:54:12,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 08:54:12,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 08:54:12,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:54:12,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:54:12,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 08:54:12,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:54:12,657 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:54:12,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:54:12,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322296778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:54:12,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:54:12,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-06 08:54:12,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422247941] [2025-02-06 08:54:12,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:54:12,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:54:12,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:54:12,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:54:12,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:54:12,659 INFO L87 Difference]: Start difference. First operand 635 states and 911 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 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:54:12,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:54:12,997 INFO L93 Difference]: Finished difference Result 1237 states and 1789 transitions. [2025-02-06 08:54:12,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:54:12,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 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:54:12,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:54:13,000 INFO L225 Difference]: With dead ends: 1237 [2025-02-06 08:54:13,000 INFO L226 Difference]: Without dead ends: 645 [2025-02-06 08:54:13,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:54:13,001 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 15 mSDsluCounter, 2199 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2696 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:54:13,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2696 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:54:13,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-02-06 08:54:13,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 643. [2025-02-06 08:54:13,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 617 states have (on average 1.421393841166937) internal successors, (877), 633 states have internal predecessors, (877), 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:54:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 919 transitions. [2025-02-06 08:54:13,019 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 919 transitions. Word has length 100 [2025-02-06 08:54:13,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:54:13,019 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 919 transitions. [2025-02-06 08:54:13,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 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:54:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 919 transitions. [2025-02-06 08:54:13,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 08:54:13,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:54:13,021 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:54:13,029 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:54:13,221 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:54:13,221 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:54:13,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:54:13,222 INFO L85 PathProgramCache]: Analyzing trace with hash -454114083, now seen corresponding path program 1 times [2025-02-06 08:54:13,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:54:13,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190529751] [2025-02-06 08:54:13,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:54:13,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:54:13,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 08:54:13,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 08:54:13,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:54:13,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:54:13,461 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:54:13,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:54:13,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190529751] [2025-02-06 08:54:13,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190529751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:54:13,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:54:13,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:54:13,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338965815] [2025-02-06 08:54:13,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:54:13,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:54:13,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:54:13,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:54:13,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:54:13,462 INFO L87 Difference]: Start difference. First operand 643 states and 919 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), 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:54:13,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:54:13,765 INFO L93 Difference]: Finished difference Result 1239 states and 1785 transitions. [2025-02-06 08:54:13,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:54:13,765 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), 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 102 [2025-02-06 08:54:13,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:54:13,768 INFO L225 Difference]: With dead ends: 1239 [2025-02-06 08:54:13,768 INFO L226 Difference]: Without dead ends: 653 [2025-02-06 08:54:13,769 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:54:13,769 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 12 mSDsluCounter, 2200 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 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.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:54:13,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2702 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:54:13,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-02-06 08:54:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 643. [2025-02-06 08:54:13,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 617 states have (on average 1.421393841166937) internal successors, (877), 633 states have internal predecessors, (877), 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:54:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 919 transitions. [2025-02-06 08:54:13,782 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 919 transitions. Word has length 102 [2025-02-06 08:54:13,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:54:13,783 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 919 transitions. [2025-02-06 08:54:13,783 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), 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:54:13,783 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 919 transitions. [2025-02-06 08:54:13,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 08:54:13,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:54:13,783 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:54:13,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:54:13,783 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:54:13,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:54:13,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1755275382, now seen corresponding path program 1 times [2025-02-06 08:54:13,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:54:13,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530844297] [2025-02-06 08:54:13,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:54:13,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:54:13,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 08:54:13,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 08:54:13,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:54:13,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:54:14,031 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:54:14,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:54:14,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530844297] [2025-02-06 08:54:14,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530844297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:54:14,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:54:14,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:54:14,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063530577] [2025-02-06 08:54:14,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:54:14,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:54:14,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:54:14,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:54:14,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:54:14,033 INFO L87 Difference]: Start difference. First operand 643 states and 919 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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:54:14,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:54:14,313 INFO L93 Difference]: Finished difference Result 1246 states and 1795 transitions. [2025-02-06 08:54:14,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:54:14,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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 102 [2025-02-06 08:54:14,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:54:14,317 INFO L225 Difference]: With dead ends: 1246 [2025-02-06 08:54:14,317 INFO L226 Difference]: Without dead ends: 649 [2025-02-06 08:54:14,318 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:54:14,318 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 8 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2265 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:54:14,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2265 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:54:14,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-02-06 08:54:14,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2025-02-06 08:54:14,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 623 states have (on average 1.4173354735152488) internal successors, (883), 639 states have internal predecessors, (883), 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:54:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 925 transitions. [2025-02-06 08:54:14,337 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 925 transitions. Word has length 102 [2025-02-06 08:54:14,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:54:14,337 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 925 transitions. [2025-02-06 08:54:14,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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:54:14,337 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 925 transitions. [2025-02-06 08:54:14,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 08:54:14,338 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:54:14,339 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] [2025-02-06 08:54:14,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 08:54:14,339 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:54:14,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:54:14,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1300189851, now seen corresponding path program 1 times [2025-02-06 08:54:14,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:54:14,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176593631] [2025-02-06 08:54:14,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:54:14,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:54:14,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 08:54:14,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 08:54:14,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:54:14,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:54:14,702 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:54:14,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:54:14,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176593631] [2025-02-06 08:54:14,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176593631] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:54:14,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:54:14,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:54:14,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488659893] [2025-02-06 08:54:14,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:54:14,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:54:14,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:54:14,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:54:14,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:54:14,704 INFO L87 Difference]: Start difference. First operand 649 states and 925 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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:54:15,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:54:15,021 INFO L93 Difference]: Finished difference Result 1253 states and 1798 transitions. [2025-02-06 08:54:15,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:54:15,022 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 103 [2025-02-06 08:54:15,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:54:15,025 INFO L225 Difference]: With dead ends: 1253 [2025-02-06 08:54:15,025 INFO L226 Difference]: Without dead ends: 669 [2025-02-06 08:54:15,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:54:15,027 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 20 mSDsluCounter, 2294 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:54:15,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2791 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:54:15,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-02-06 08:54:15,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 663. [2025-02-06 08:54:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 637 states have (on average 1.414442700156986) internal successors, (901), 653 states have internal predecessors, (901), 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:54:15,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 943 transitions. [2025-02-06 08:54:15,045 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 943 transitions. Word has length 103 [2025-02-06 08:54:15,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:54:15,045 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 943 transitions. [2025-02-06 08:54:15,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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:54:15,046 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 943 transitions. [2025-02-06 08:54:15,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 08:54:15,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:54:15,047 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] [2025-02-06 08:54:15,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 08:54:15,047 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:54:15,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:54:15,047 INFO L85 PathProgramCache]: Analyzing trace with hash 829374320, now seen corresponding path program 1 times [2025-02-06 08:54:15,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:54:15,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787195036] [2025-02-06 08:54:15,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:54:15,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:54:15,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 08:54:15,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 08:54:15,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:54:15,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:54:15,302 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:54:15,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:54:15,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787195036] [2025-02-06 08:54:15,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787195036] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:54:15,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556441126] [2025-02-06 08:54:15,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:54:15,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:54:15,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:54:15,306 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:54:15,309 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:54:15,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 08:54:15,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 08:54:15,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:54:15,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:54:15,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 08:54:15,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:54:15,676 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:54:15,677 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:54:15,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556441126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:54:15,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:54:15,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-02-06 08:54:15,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252655210] [2025-02-06 08:54:15,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:54:15,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 08:54:15,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:54:15,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 08:54:15,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:54:15,679 INFO L87 Difference]: Start difference. First operand 663 states and 943 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 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:54:16,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:54:16,037 INFO L93 Difference]: Finished difference Result 1278 states and 1829 transitions. [2025-02-06 08:54:16,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:54:16,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 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 103 [2025-02-06 08:54:16,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:54:16,040 INFO L225 Difference]: With dead ends: 1278 [2025-02-06 08:54:16,040 INFO L226 Difference]: Without dead ends: 687 [2025-02-06 08:54:16,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:54:16,042 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 40 mSDsluCounter, 2252 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2755 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:54:16,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2755 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:54:16,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-02-06 08:54:16,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 673. [2025-02-06 08:54:16,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 647 states have (on average 1.41112828438949) internal successors, (913), 663 states have internal predecessors, (913), 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:54:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 955 transitions. [2025-02-06 08:54:16,061 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 955 transitions. Word has length 103 [2025-02-06 08:54:16,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:54:16,061 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 955 transitions. [2025-02-06 08:54:16,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 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:54:16,061 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 955 transitions. [2025-02-06 08:54:16,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 08:54:16,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:54:16,062 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:54:16,070 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:54:16,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:54:16,263 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:54:16,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:54:16,264 INFO L85 PathProgramCache]: Analyzing trace with hash 290489270, now seen corresponding path program 1 times [2025-02-06 08:54:16,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:54:16,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422252183] [2025-02-06 08:54:16,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:54:16,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:54:16,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 08:54:16,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 08:54:16,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:54:16,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:54:16,599 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:54:16,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:54:16,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422252183] [2025-02-06 08:54:16,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422252183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:54:16,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:54:16,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 08:54:16,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338293171] [2025-02-06 08:54:16,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:54:16,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:54:16,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:54:16,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:54:16,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:54:16,601 INFO L87 Difference]: Start difference. First operand 673 states and 955 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:54:17,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:54:17,002 INFO L93 Difference]: Finished difference Result 1292 states and 1849 transitions. [2025-02-06 08:54:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:54:17,003 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:54:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:54:17,006 INFO L225 Difference]: With dead ends: 1292 [2025-02-06 08:54:17,006 INFO L226 Difference]: Without dead ends: 691 [2025-02-06 08:54:17,008 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:54:17,010 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 26 mSDsluCounter, 2708 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3211 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:54:17,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3211 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:54:17,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-02-06 08:54:17,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 679. [2025-02-06 08:54:17,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 653 states have (on average 1.4073506891271057) internal successors, (919), 669 states have internal predecessors, (919), 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:54:17,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 961 transitions. [2025-02-06 08:54:17,028 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 961 transitions. Word has length 104 [2025-02-06 08:54:17,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:54:17,028 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 961 transitions. [2025-02-06 08:54:17,028 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:54:17,028 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 961 transitions. [2025-02-06 08:54:17,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 08:54:17,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:54:17,030 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:54:17,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 08:54:17,031 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:54:17,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:54:17,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1658725871, now seen corresponding path program 1 times [2025-02-06 08:54:17,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:54:17,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773247017] [2025-02-06 08:54:17,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:54:17,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:54:17,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 08:54:17,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 08:54:17,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:54:17,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:54:17,231 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:54:17,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:54:17,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773247017] [2025-02-06 08:54:17,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773247017] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:54:17,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412068392] [2025-02-06 08:54:17,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:54:17,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:54:17,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:54:17,233 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:54:17,237 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:54:17,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 08:54:17,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 08:54:17,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:54:17,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:54:17,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 08:54:17,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:54:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:54:17,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:54:17,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412068392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:54:17,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:54:17,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-06 08:54:17,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832690744] [2025-02-06 08:54:17,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:54:17,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:54:17,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:54:17,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:54:17,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:54:17,681 INFO L87 Difference]: Start difference. First operand 679 states and 961 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:54:17,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:54:17,763 INFO L93 Difference]: Finished difference Result 1249 states and 1783 transitions. [2025-02-06 08:54:17,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:54:17,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-02-06 08:54:17,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:54:17,767 INFO L225 Difference]: With dead ends: 1249 [2025-02-06 08:54:17,767 INFO L226 Difference]: Without dead ends: 682 [2025-02-06 08:54:17,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 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:54:17,768 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:54:17,769 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:54:17,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-02-06 08:54:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2025-02-06 08:54:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 655 states have (on average 1.4076335877862596) internal successors, (922), 672 states have internal predecessors, (922), 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:54:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 965 transitions. [2025-02-06 08:54:17,786 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 965 transitions. Word has length 104 [2025-02-06 08:54:17,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:54:17,786 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 965 transitions. [2025-02-06 08:54:17,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:54:17,786 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 965 transitions. [2025-02-06 08:54:17,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 08:54:17,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:54:17,787 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] [2025-02-06 08:54:17,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 08:54:17,988 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,SelfDestructingSolverStorable11 [2025-02-06 08:54:17,989 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:54:17,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:54:17,989 INFO L85 PathProgramCache]: Analyzing trace with hash -232941709, now seen corresponding path program 1 times [2025-02-06 08:54:17,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:54:17,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658918156] [2025-02-06 08:54:17,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:54:17,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:54:18,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 08:54:18,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 08:54:18,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:54:18,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:54:18,216 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:54:18,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:54:18,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658918156] [2025-02-06 08:54:18,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658918156] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:54:18,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322934055] [2025-02-06 08:54:18,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:54:18,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:54:18,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:54:18,219 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:54:18,220 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:54:18,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 08:54:18,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 08:54:18,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:54:18,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:54:18,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-02-06 08:54:18,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:54:19,002 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:54:19,077 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2025-02-06 08:54:19,078 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:54:19,085 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:54:19,114 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:54:19,189 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 08:54:19,190 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 [2025-02-06 08:54:26,113 INFO L224 Elim1Store]: Index analysis took 322 ms