./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.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 06557c270490180718c8b17df780a67c95f9f8a79364859de2d5e3b0ea99ce3e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:19:06,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:19:06,381 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:19:06,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:19:06,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:19:06,399 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:19:06,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:19:06,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:19:06,401 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:19:06,401 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:19:06,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:19:06,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:19:06,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:19:06,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:19:06,402 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:19:06,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:19:06,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:19:06,403 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:19:06,403 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:19:06,403 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:19:06,403 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:19:06,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:19:06,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:19:06,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:19:06,403 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:19:06,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:19:06,404 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:19:06,404 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:19:06,404 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:19:06,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:19:06,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:19:06,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:19:06,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:19:06,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:19:06,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:19:06,405 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:19:06,405 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:19:06,405 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:19:06,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:19:06,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:19:06,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:19:06,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:19:06,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:19:06,405 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 -> 06557c270490180718c8b17df780a67c95f9f8a79364859de2d5e3b0ea99ce3e [2025-02-06 03:19:06,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:19:06,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:19:06,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:19:06,650 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:19:06,650 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:19:06,651 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i [2025-02-06 03:19:07,835 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7299c00e4/687f9e1fc5e2468198fee22b8cd94e3a/FLAG7090ab271 [2025-02-06 03:19:08,151 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:19:08,152 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i [2025-02-06 03:19:08,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7299c00e4/687f9e1fc5e2468198fee22b8cd94e3a/FLAG7090ab271 [2025-02-06 03:19:08,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7299c00e4/687f9e1fc5e2468198fee22b8cd94e3a [2025-02-06 03:19:08,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:19:08,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:19:08,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:19:08,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:19:08,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:19:08,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:19:08" (1/1) ... [2025-02-06 03:19:08,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ea4a69f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:08, skipping insertion in model container [2025-02-06 03:19:08,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:19:08" (1/1) ... [2025-02-06 03:19:08,462 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:19:08,568 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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i[916,929] [2025-02-06 03:19:08,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:19:08,612 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:19:08,621 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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i[916,929] [2025-02-06 03:19:08,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:19:08,682 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:19:08,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:08 WrapperNode [2025-02-06 03:19:08,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:19:08,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:19:08,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:19:08,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:19:08,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:08" (1/1) ... [2025-02-06 03:19:08,698 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:08" (1/1) ... [2025-02-06 03:19:08,737 INFO L138 Inliner]: procedures = 29, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 474 [2025-02-06 03:19:08,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:19:08,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:19:08,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:19:08,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:19:08,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:08" (1/1) ... [2025-02-06 03:19:08,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:08" (1/1) ... [2025-02-06 03:19:08,749 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:08" (1/1) ... [2025-02-06 03:19:08,760 INFO L175 MemorySlicer]: Split 131 memory accesses to 6 slices as follows [2, 16, 23, 31, 7, 52]. 40 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 2, 2, 2, 1, 4]. The 18 writes are split as follows [0, 2, 5, 5, 2, 4]. [2025-02-06 03:19:08,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:08" (1/1) ... [2025-02-06 03:19:08,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:08" (1/1) ... [2025-02-06 03:19:08,783 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:08" (1/1) ... [2025-02-06 03:19:08,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:08" (1/1) ... [2025-02-06 03:19:08,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:08" (1/1) ... [2025-02-06 03:19:08,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:08" (1/1) ... [2025-02-06 03:19:08,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:19:08,790 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:19:08,790 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:19:08,790 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:19:08,790 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:08" (1/1) ... [2025-02-06 03:19:08,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:19:08,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:19:08,820 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 03:19:08,825 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 03:19:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:19:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:19:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:19:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:19:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:19:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:19:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:19:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:19:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:19:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:19:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:19:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:19:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:19:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:19:08,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:19:08,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:19:08,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:19:08,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:19:08,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:19:08,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:19:08,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:19:08,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:19:08,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:19:08,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:19:08,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:19:08,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:19:08,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:19:08,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:19:08,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:19:08,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:19:08,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:19:08,841 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:19:08,842 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:19:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:19:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:19:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:19:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:19:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:19:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:19:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:19:08,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:19:09,005 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:19:09,007 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:19:09,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem77#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite76#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem78#1;havoc property_#t~ite86#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite85#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem94#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite93#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite109#1;havoc property_#t~mem96#1;havoc property_#t~mem95#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~short99#1;havoc property_#t~ite108#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite107#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem106#1;havoc property_#t~short110#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~short115#1;havoc property_#t~ite130#1;havoc property_#t~mem116#1;havoc property_#t~ite127#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~ite124#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1; [2025-02-06 03:19:09,418 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2025-02-06 03:19:09,419 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:19:09,432 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:19:09,432 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:19:09,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:19:09 BoogieIcfgContainer [2025-02-06 03:19:09,432 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:19:09,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:19:09,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:19:09,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:19:09,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:19:08" (1/3) ... [2025-02-06 03:19:09,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59926cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:19:09, skipping insertion in model container [2025-02-06 03:19:09,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:08" (2/3) ... [2025-02-06 03:19:09,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59926cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:19:09, skipping insertion in model container [2025-02-06 03:19:09,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:19:09" (3/3) ... [2025-02-06 03:19:09,440 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-69.i [2025-02-06 03:19:09,451 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:19:09,452 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-69.i that has 2 procedures, 93 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:19:09,492 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:19:09,502 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;@8ca3156, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:19:09,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:19:09,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 76 states have internal predecessors, (107), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:19:09,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:19:09,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:09,514 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:09,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:09,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:09,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1657933221, now seen corresponding path program 1 times [2025-02-06 03:19:09,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:09,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936471325] [2025-02-06 03:19:09,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:09,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:09,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:19:09,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:19:09,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:09,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:09,773 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 03:19:09,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:19:09,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936471325] [2025-02-06 03:19:09,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936471325] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:19:09,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093712024] [2025-02-06 03:19:09,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:09,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:19:09,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:19:09,785 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 03:19:09,789 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 03:19:09,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:19:09,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:19:09,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:09,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:09,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:19:09,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:10,019 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 03:19:10,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:10,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093712024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:10,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:19:10,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:19:10,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041626988] [2025-02-06 03:19:10,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:10,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:19:10,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:19:10,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:19:10,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:19:10,044 INFO L87 Difference]: Start difference. First operand has 93 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 76 states have internal predecessors, (107), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:19:10,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:10,067 INFO L93 Difference]: Finished difference Result 180 states and 284 transitions. [2025-02-06 03:19:10,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:19:10,068 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2025-02-06 03:19:10,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:10,073 INFO L225 Difference]: With dead ends: 180 [2025-02-06 03:19:10,074 INFO L226 Difference]: Without dead ends: 90 [2025-02-06 03:19:10,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 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 03:19:10,079 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:10,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:19:10,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-06 03:19:10,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-02-06 03:19:10,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 73 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:19:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2025-02-06 03:19:10,109 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 119 [2025-02-06 03:19:10,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:10,110 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2025-02-06 03:19:10,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:19:10,110 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2025-02-06 03:19:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:19:10,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:10,114 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:10,121 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 03:19:10,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:19:10,315 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:10,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:10,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2016175906, now seen corresponding path program 1 times [2025-02-06 03:19:10,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:10,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827717466] [2025-02-06 03:19:10,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:10,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:10,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:19:10,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:19:10,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:10,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:10,694 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:19:10,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:19:10,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827717466] [2025-02-06 03:19:10,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827717466] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:19:10,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221678056] [2025-02-06 03:19:10,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:10,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:19:10,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:19:10,696 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 03:19:10,698 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 03:19:10,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:19:10,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:19:10,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:10,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:10,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:19:10,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:10,887 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:19:10,887 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:10,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221678056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:10,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:19:10,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-06 03:19:10,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402517093] [2025-02-06 03:19:10,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:10,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:19:10,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:19:10,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:19:10,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:19:10,888 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:10,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:10,928 INFO L93 Difference]: Finished difference Result 179 states and 264 transitions. [2025-02-06 03:19:10,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:19:10,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2025-02-06 03:19:10,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:10,931 INFO L225 Difference]: With dead ends: 179 [2025-02-06 03:19:10,931 INFO L226 Difference]: Without dead ends: 92 [2025-02-06 03:19:10,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:19:10,933 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:10,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 379 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:19:10,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-06 03:19:10,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-06 03:19:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:19:10,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2025-02-06 03:19:10,941 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 119 [2025-02-06 03:19:10,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:10,942 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2025-02-06 03:19:10,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2025-02-06 03:19:10,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:19:10,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:10,944 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:10,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 03:19:11,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:19:11,145 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:11,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:11,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2145101472, now seen corresponding path program 1 times [2025-02-06 03:19:11,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:11,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815045346] [2025-02-06 03:19:11,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:11,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:11,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:19:11,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:19:11,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:11,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:19:11,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [305595339] [2025-02-06 03:19:11,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:11,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:19:11,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:19:11,288 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 03:19:11,290 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 03:19:11,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:19:11,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:19:11,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:11,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:11,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 03:19:11,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:11,568 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 9 treesize of output 3 [2025-02-06 03:19:11,581 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 19 treesize of output 1 [2025-02-06 03:19:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:19:11,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:11,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:19:11,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815045346] [2025-02-06 03:19:11,745 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:19:11,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305595339] [2025-02-06 03:19:11,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305595339] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:11,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:11,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:19:11,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515651140] [2025-02-06 03:19:11,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:11,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:19:11,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:19:11,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:19:11,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:19:11,746 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:11,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:11,979 INFO L93 Difference]: Finished difference Result 247 states and 359 transitions. [2025-02-06 03:19:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:19:11,981 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2025-02-06 03:19:11,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:11,982 INFO L225 Difference]: With dead ends: 247 [2025-02-06 03:19:11,982 INFO L226 Difference]: Without dead ends: 158 [2025-02-06 03:19:11,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:19:11,983 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 85 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:11,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 668 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:19:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-06 03:19:12,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2025-02-06 03:19:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 130 states have (on average 1.3923076923076922) internal successors, (181), 131 states have internal predecessors, (181), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:19:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 225 transitions. [2025-02-06 03:19:12,010 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 225 transitions. Word has length 121 [2025-02-06 03:19:12,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:12,010 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 225 transitions. [2025-02-06 03:19:12,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:12,011 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 225 transitions. [2025-02-06 03:19:12,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:19:12,014 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:12,015 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:12,025 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 03:19:12,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:19:12,215 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:12,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:12,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1856462817, now seen corresponding path program 1 times [2025-02-06 03:19:12,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:12,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735211345] [2025-02-06 03:19:12,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:12,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:12,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:19:12,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:19:12,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:12,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:12,781 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:19:12,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:19:12,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735211345] [2025-02-06 03:19:12,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735211345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:12,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:12,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:19:12,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226511628] [2025-02-06 03:19:12,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:12,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:19:12,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:19:12,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:19:12,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:19:12,783 INFO L87 Difference]: Start difference. First operand 155 states and 225 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:13,162 INFO L93 Difference]: Finished difference Result 507 states and 735 transitions. [2025-02-06 03:19:13,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:19:13,163 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2025-02-06 03:19:13,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:13,166 INFO L225 Difference]: With dead ends: 507 [2025-02-06 03:19:13,166 INFO L226 Difference]: Without dead ends: 355 [2025-02-06 03:19:13,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:19:13,167 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 193 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:13,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 770 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:19:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-02-06 03:19:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 349. [2025-02-06 03:19:13,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 294 states have (on average 1.3911564625850341) internal successors, (409), 298 states have internal predecessors, (409), 49 states have call successors, (49), 5 states have call predecessors, (49), 5 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-06 03:19:13,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 507 transitions. [2025-02-06 03:19:13,200 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 507 transitions. Word has length 121 [2025-02-06 03:19:13,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:13,200 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 507 transitions. [2025-02-06 03:19:13,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:13,200 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 507 transitions. [2025-02-06 03:19:13,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:19:13,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:13,202 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:13,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:19:13,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:13,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:13,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1305393953, now seen corresponding path program 1 times [2025-02-06 03:19:13,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:13,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562424621] [2025-02-06 03:19:13,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:13,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:13,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:19:13,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:19:13,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:13,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:13,549 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:19:13,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:19:13,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562424621] [2025-02-06 03:19:13,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562424621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:13,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:13,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:19:13,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710105619] [2025-02-06 03:19:13,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:13,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:19:13,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:19:13,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:19:13,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:19:13,550 INFO L87 Difference]: Start difference. First operand 349 states and 507 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:13,891 INFO L93 Difference]: Finished difference Result 767 states and 1111 transitions. [2025-02-06 03:19:13,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:19:13,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2025-02-06 03:19:13,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:13,896 INFO L225 Difference]: With dead ends: 767 [2025-02-06 03:19:13,896 INFO L226 Difference]: Without dead ends: 421 [2025-02-06 03:19:13,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:19:13,897 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 90 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:13,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 749 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:19:13,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-02-06 03:19:13,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 360. [2025-02-06 03:19:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 304 states have (on average 1.388157894736842) internal successors, (422), 308 states have internal predecessors, (422), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-06 03:19:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 520 transitions. [2025-02-06 03:19:13,932 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 520 transitions. Word has length 121 [2025-02-06 03:19:13,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:13,933 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 520 transitions. [2025-02-06 03:19:13,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 520 transitions. [2025-02-06 03:19:13,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:19:13,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:13,934 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:13,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:19:13,934 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:13,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:13,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1011990946, now seen corresponding path program 1 times [2025-02-06 03:19:13,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:13,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439312435] [2025-02-06 03:19:13,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:13,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:13,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:19:14,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:19:14,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:14,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:19:14,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1897164129] [2025-02-06 03:19:14,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:14,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:19:14,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:19:14,008 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 03:19:14,010 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 03:19:14,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:19:14,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:19:14,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:14,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:14,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 03:19:14,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:14,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:14,267 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 19 treesize of output 7 [2025-02-06 03:19:14,276 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 19 treesize of output 1 [2025-02-06 03:19:14,281 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 19 treesize of output 1 [2025-02-06 03:19:14,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:14,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 19 [2025-02-06 03:19:14,405 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:19:14,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:14,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:19:14,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439312435] [2025-02-06 03:19:14,407 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:19:14,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897164129] [2025-02-06 03:19:14,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897164129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:14,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:14,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:19:14,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379907659] [2025-02-06 03:19:14,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:14,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:19:14,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:19:14,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:19:14,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:19:14,408 INFO L87 Difference]: Start difference. First operand 360 states and 520 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:14,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:14,691 INFO L93 Difference]: Finished difference Result 831 states and 1198 transitions. [2025-02-06 03:19:14,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:19:14,691 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2025-02-06 03:19:14,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:14,694 INFO L225 Difference]: With dead ends: 831 [2025-02-06 03:19:14,694 INFO L226 Difference]: Without dead ends: 474 [2025-02-06 03:19:14,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:19:14,695 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 76 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:14,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1009 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:19:14,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-02-06 03:19:14,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 421. [2025-02-06 03:19:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 357 states have (on average 1.3865546218487395) internal successors, (495), 362 states have internal predecessors, (495), 56 states have call successors, (56), 7 states have call predecessors, (56), 7 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-06 03:19:14,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 607 transitions. [2025-02-06 03:19:14,723 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 607 transitions. Word has length 121 [2025-02-06 03:19:14,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:14,723 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 607 transitions. [2025-02-06 03:19:14,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:14,724 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 607 transitions. [2025-02-06 03:19:14,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:19:14,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:14,725 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:14,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 03:19:14,925 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,SelfDestructingSolverStorable5 [2025-02-06 03:19:14,926 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:14,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:14,926 INFO L85 PathProgramCache]: Analyzing trace with hash -400448190, now seen corresponding path program 1 times [2025-02-06 03:19:14,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:14,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445616965] [2025-02-06 03:19:14,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:14,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:14,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:19:14,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:19:14,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:14,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:15,248 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:19:15,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:19:15,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445616965] [2025-02-06 03:19:15,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445616965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:15,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:15,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:19:15,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058985644] [2025-02-06 03:19:15,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:15,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:19:15,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:19:15,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:19:15,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:19:15,250 INFO L87 Difference]: Start difference. First operand 421 states and 607 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:15,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:15,589 INFO L93 Difference]: Finished difference Result 1091 states and 1561 transitions. [2025-02-06 03:19:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:19:15,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2025-02-06 03:19:15,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:15,593 INFO L225 Difference]: With dead ends: 1091 [2025-02-06 03:19:15,593 INFO L226 Difference]: Without dead ends: 673 [2025-02-06 03:19:15,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:19:15,598 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 200 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:15,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 670 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:19:15,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-02-06 03:19:15,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 301. [2025-02-06 03:19:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 254 states have (on average 1.3818897637795275) internal successors, (351), 257 states have internal predecessors, (351), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:19:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 431 transitions. [2025-02-06 03:19:15,627 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 431 transitions. Word has length 121 [2025-02-06 03:19:15,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:15,627 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 431 transitions. [2025-02-06 03:19:15,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:15,627 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 431 transitions. [2025-02-06 03:19:15,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:19:15,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:15,628 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:15,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:19:15,629 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:15,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:15,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1436829353, now seen corresponding path program 1 times [2025-02-06 03:19:15,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:15,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330755757] [2025-02-06 03:19:15,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:15,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:15,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:19:15,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:19:15,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:15,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:15,832 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:19:15,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:19:15,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330755757] [2025-02-06 03:19:15,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330755757] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:15,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:15,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:19:15,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901220404] [2025-02-06 03:19:15,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:15,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:19:15,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:19:15,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:19:15,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:19:15,834 INFO L87 Difference]: Start difference. First operand 301 states and 431 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:15,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:15,950 INFO L93 Difference]: Finished difference Result 672 states and 958 transitions. [2025-02-06 03:19:15,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:19:15,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-02-06 03:19:15,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:15,952 INFO L225 Difference]: With dead ends: 672 [2025-02-06 03:19:15,952 INFO L226 Difference]: Without dead ends: 374 [2025-02-06 03:19:15,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:19:15,954 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 109 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:15,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 988 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:19:15,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-02-06 03:19:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 305. [2025-02-06 03:19:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 255 states have (on average 1.3725490196078431) internal successors, (350), 258 states have internal predecessors, (350), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 03:19:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 434 transitions. [2025-02-06 03:19:15,977 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 434 transitions. Word has length 122 [2025-02-06 03:19:15,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:15,978 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 434 transitions. [2025-02-06 03:19:15,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:15,978 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 434 transitions. [2025-02-06 03:19:15,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:19:15,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:15,979 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:15,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:19:15,979 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:15,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:15,980 INFO L85 PathProgramCache]: Analyzing trace with hash 625305086, now seen corresponding path program 1 times [2025-02-06 03:19:15,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:15,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124514732] [2025-02-06 03:19:15,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:15,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:15,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:19:16,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:19:16,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:16,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:16,254 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:19:16,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:19:16,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124514732] [2025-02-06 03:19:16,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124514732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:16,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:16,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:19:16,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669876229] [2025-02-06 03:19:16,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:16,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:19:16,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:19:16,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:19:16,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:19:16,256 INFO L87 Difference]: Start difference. First operand 305 states and 434 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:16,363 INFO L93 Difference]: Finished difference Result 858 states and 1221 transitions. [2025-02-06 03:19:16,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:19:16,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-02-06 03:19:16,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:16,366 INFO L225 Difference]: With dead ends: 858 [2025-02-06 03:19:16,366 INFO L226 Difference]: Without dead ends: 556 [2025-02-06 03:19:16,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:19:16,367 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 76 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:16,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 674 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:19:16,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-02-06 03:19:16,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 550. [2025-02-06 03:19:16,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 476 states have (on average 1.3802521008403361) internal successors, (657), 483 states have internal predecessors, (657), 62 states have call successors, (62), 11 states have call predecessors, (62), 11 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 03:19:16,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 781 transitions. [2025-02-06 03:19:16,404 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 781 transitions. Word has length 122 [2025-02-06 03:19:16,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:16,404 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 781 transitions. [2025-02-06 03:19:16,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 781 transitions. [2025-02-06 03:19:16,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:19:16,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:16,406 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:16,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:19:16,406 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:16,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:16,406 INFO L85 PathProgramCache]: Analyzing trace with hash 82228685, now seen corresponding path program 1 times [2025-02-06 03:19:16,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:16,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591683277] [2025-02-06 03:19:16,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:16,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:16,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:19:16,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:19:16,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:16,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:19:16,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [834942791] [2025-02-06 03:19:16,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:16,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:19:16,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:19:16,466 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 03:19:16,469 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 03:19:16,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:19:16,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:19:16,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:16,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:16,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 03:19:16,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:16,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:16,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 19 [2025-02-06 03:19:16,870 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:19:16,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:16,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:19:16,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591683277] [2025-02-06 03:19:16,871 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:19:16,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834942791] [2025-02-06 03:19:16,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834942791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:16,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:16,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:19:16,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957221285] [2025-02-06 03:19:16,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:16,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:19:16,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:19:16,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:19:16,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:19:16,872 INFO L87 Difference]: Start difference. First operand 550 states and 781 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:17,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:17,513 INFO L93 Difference]: Finished difference Result 1349 states and 1914 transitions. [2025-02-06 03:19:17,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:19:17,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2025-02-06 03:19:17,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:17,518 INFO L225 Difference]: With dead ends: 1349 [2025-02-06 03:19:17,518 INFO L226 Difference]: Without dead ends: 802 [2025-02-06 03:19:17,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:19:17,520 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 87 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:17,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 510 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:19:17,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-02-06 03:19:17,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 518. [2025-02-06 03:19:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 460 states have (on average 1.391304347826087) internal successors, (640), 465 states have internal predecessors, (640), 48 states have call successors, (48), 9 states have call predecessors, (48), 9 states have return successors, (48), 43 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 03:19:17,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 736 transitions. [2025-02-06 03:19:17,570 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 736 transitions. Word has length 125 [2025-02-06 03:19:17,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:17,571 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 736 transitions. [2025-02-06 03:19:17,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 736 transitions. [2025-02-06 03:19:17,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:19:17,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:17,573 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:17,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 03:19:17,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 03:19:17,773 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:17,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:17,774 INFO L85 PathProgramCache]: Analyzing trace with hash 211311404, now seen corresponding path program 1 times [2025-02-06 03:19:17,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:17,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164789459] [2025-02-06 03:19:17,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:17,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:17,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:19:17,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:19:17,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:17,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:19:17,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1272392172] [2025-02-06 03:19:17,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:17,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:19:17,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:19:17,861 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:19:17,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 03:19:17,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:19:18,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:19:18,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:18,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:19:18,115 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:19:18,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:19:24,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:19:24,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:24,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:19:25,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:19:25,046 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:19:25,047 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:19:25,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 03:19:25,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 03:19:25,251 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:19:25,332 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:19:25,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:19:25 BoogieIcfgContainer [2025-02-06 03:19:25,335 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:19:25,336 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:19:25,336 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:19:25,337 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:19:25,337 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:19:09" (3/4) ... [2025-02-06 03:19:25,339 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:19:25,340 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:19:25,340 INFO L158 Benchmark]: Toolchain (without parser) took 16901.94ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 105.4MB in the beginning and 226.3MB in the end (delta: -120.9MB). Peak memory consumption was 128.6MB. Max. memory is 16.1GB. [2025-02-06 03:19:25,340 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:19:25,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.01ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 89.6MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:19:25,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.79ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 86.4MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:19:25,341 INFO L158 Benchmark]: Boogie Preprocessor took 49.29ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 83.3MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:19:25,341 INFO L158 Benchmark]: IcfgBuilder took 642.87ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 51.9MB in the end (delta: 31.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 03:19:25,341 INFO L158 Benchmark]: TraceAbstraction took 15900.80ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 50.8MB in the beginning and 226.4MB in the end (delta: -175.6MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. [2025-02-06 03:19:25,341 INFO L158 Benchmark]: Witness Printer took 3.40ms. Allocated memory is still 394.3MB. Free memory was 226.4MB in the beginning and 226.3MB in the end (delta: 101.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:19:25,342 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.01ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 89.6MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.79ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 86.4MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.29ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 83.3MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 642.87ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 51.9MB in the end (delta: 31.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15900.80ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 50.8MB in the beginning and 226.4MB in the end (delta: -175.6MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. * Witness Printer took 3.40ms. Allocated memory is still 394.3MB. Free memory was 226.4MB in the beginning and 226.3MB in the end (delta: 101.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2] = { 15.5, 4.625 }; [L25-L27] double double_Array_0[2] = { 15.5, 4.625 }; [L25-L27] double double_Array_0[2] = { 15.5, 4.625 }; [L28-L30] signed char signed_char_Array_0[2] = { -8, -64 }; [L28-L30] signed char signed_char_Array_0[2] = { -8, -64 }; [L28-L30] signed char signed_char_Array_0[2] = { -8, -64 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -100 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -100 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] FCALL updateLastVariables() [L114] CALL updateVariables() [L79] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L80] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L83] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] double_Array_0[0] = __VERIFIER_nondet_double() [L86] EXPR double_Array_0[0] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L86] EXPR double_Array_0[0] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L88] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] unsigned_long_int_Array_0[0][0] = __VERIFIER_nondet_ulong() [L91] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] unsigned_long_int_Array_0[1][0] = __VERIFIER_nondet_ulong() [L94] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L96] unsigned_long_int_Array_0[0][1] = __VERIFIER_nondet_ulong() [L97] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L99] unsigned_long_int_Array_0[1][1] = __VERIFIER_nondet_ulong() [L100] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L100] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L100] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L114] RET updateVariables() [L115] CALL step() [L40] EXPR unsigned_long_int_Array_0[1][1] [L40] EXPR unsigned_long_int_Array_0[1][0] [L40] EXPR unsigned_long_int_Array_0[0][0] [L40] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L40] EXPR (((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]) [L40] EXPR unsigned_long_int_Array_0[0][1] [L40] EXPR (((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L40] COND TRUE unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]))) [L41] EXPR signed_char_Array_0[0] [L41] signed_char_Array_0[1] = signed_char_Array_0[0] [L53] EXPR unsigned_long_int_Array_0[0][0] [L53] unsigned long int stepLocal_1 = unsigned_long_int_Array_0[0][0]; [L54] EXPR unsigned_long_int_Array_0[1][1] [L54] EXPR unsigned_long_int_Array_0[0][1] [L54] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L54] EXPR ((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) [L54] EXPR unsigned_long_int_Array_0[0][1] [L54] EXPR ((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_1=-1, unsigned_long_int_Array_0={8:0}] [L54] unsigned long int stepLocal_0 = unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]))); [L55] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L55] COND FALSE !(stepLocal_0 < unsigned_long_int_Array_0[0][0]) [L62] EXPR BOOL_unsigned_char_Array_0[0] [L62] unsigned char stepLocal_3 = BOOL_unsigned_char_Array_0[0]; [L63] EXPR signed_short_int_Array_0[0] [L63] EXPR signed_char_Array_0[1] [L63] signed long int stepLocal_2 = signed_short_int_Array_0[0] + signed_char_Array_0[1]; [L64] EXPR signed_char_Array_0[1] [L64] EXPR signed_char_Array_0[0] [L64] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L64] COND FALSE !(((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && stepLocal_3) [L75] EXPR double_Array_0[0] [L75] double_Array_0[1] = double_Array_0[0] [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR unsigned_long_int_Array_0[1][1] [L106] EXPR unsigned_long_int_Array_0[0][1] [L106] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) [L106] EXPR unsigned_long_int_Array_0[0][1] [L106] EXPR ((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1 [L106] EXPR ((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4))))) [L106] EXPR unsigned_long_int_Array_0[1][1] [L106] EXPR unsigned_long_int_Array_0[1][0] [L106] EXPR unsigned_long_int_Array_0[0][0] [L106] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]) [L106] EXPR unsigned_long_int_Array_0[0][1] [L106] EXPR (((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))) [L106] EXPR signed_char_Array_0[1] [L106] EXPR signed_char_Array_0[0] [L106] EXPR (unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))))) && ((((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))))) && ((((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) [L106] EXPR signed_char_Array_0[1] [L106] EXPR signed_char_Array_0[0] [L106] EXPR unsigned_long_int_Array_0[1][0] [L106] EXPR ((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0] [L106] EXPR BOOL_unsigned_char_Array_0[0] [L106] EXPR ((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0])) [L106] EXPR double_Array_0[1] [L106] EXPR double_Array_0[0] [L106] EXPR (((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))))) && ((((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106-L107] return ((((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))))) && ((((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.8s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 916 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 916 mSDsluCounter, 6549 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4995 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1578 IncrementalHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 1554 mSDtfsCounter, 1578 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 657 GetRequests, 600 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=550occurred in iteration=9, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 854 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2067 NumberOfCodeBlocks, 2067 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1438 ConstructedInterpolants, 0 QuantifiedInterpolants, 3116 SizeOfPredicates, 11 NumberOfNonLiveVariables, 2154 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 4970/5040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 03:19:25,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 06557c270490180718c8b17df780a67c95f9f8a79364859de2d5e3b0ea99ce3e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:19:27,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:19:27,393 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:19:27,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:19:27,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:19:27,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:19:27,421 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:19:27,421 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:19:27,422 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:19:27,422 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:19:27,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:19:27,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:19:27,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:19:27,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:19:27,423 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:19:27,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:19:27,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:19:27,424 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:19:27,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:19:27,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:19:27,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:19:27,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:19:27,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:19:27,424 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:19:27,424 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:19:27,424 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:19:27,424 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:19:27,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:19:27,425 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:19:27,425 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:19:27,425 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:19:27,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:19:27,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:19:27,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:19:27,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:19:27,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:19:27,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:19:27,426 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:19:27,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:19:27,426 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:19:27,426 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:19:27,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:19:27,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:19:27,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:19:27,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:19:27,427 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 -> 06557c270490180718c8b17df780a67c95f9f8a79364859de2d5e3b0ea99ce3e [2025-02-06 03:19:27,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:19:27,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:19:27,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:19:27,694 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:19:27,694 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:19:27,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i [2025-02-06 03:19:28,952 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f544fef0/05fcdfac0e174578b632e3dd31bf8dd6/FLAG282a42170 [2025-02-06 03:19:29,154 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:19:29,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i [2025-02-06 03:19:29,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f544fef0/05fcdfac0e174578b632e3dd31bf8dd6/FLAG282a42170 [2025-02-06 03:19:29,508 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f544fef0/05fcdfac0e174578b632e3dd31bf8dd6 [2025-02-06 03:19:29,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:19:29,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:19:29,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:19:29,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:19:29,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:19:29,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:19:29" (1/1) ... [2025-02-06 03:19:29,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bedce09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:29, skipping insertion in model container [2025-02-06 03:19:29,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:19:29" (1/1) ... [2025-02-06 03:19:29,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:19:29,626 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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i[916,929] [2025-02-06 03:19:29,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:19:29,679 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:19:29,690 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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i[916,929] [2025-02-06 03:19:29,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:19:29,768 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:19:29,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:29 WrapperNode [2025-02-06 03:19:29,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:19:29,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:19:29,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:19:29,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:19:29,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:29" (1/1) ... [2025-02-06 03:19:29,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:29" (1/1) ... [2025-02-06 03:19:29,832 INFO L138 Inliner]: procedures = 36, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 473 [2025-02-06 03:19:29,832 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:19:29,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:19:29,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:19:29,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:19:29,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:29" (1/1) ... [2025-02-06 03:19:29,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:29" (1/1) ... [2025-02-06 03:19:29,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:29" (1/1) ... [2025-02-06 03:19:29,877 INFO L175 MemorySlicer]: Split 131 memory accesses to 6 slices as follows [2, 16, 23, 31, 7, 52]. 40 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 2, 2, 2, 1, 4]. The 18 writes are split as follows [0, 2, 5, 5, 2, 4]. [2025-02-06 03:19:29,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:29" (1/1) ... [2025-02-06 03:19:29,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:29" (1/1) ... [2025-02-06 03:19:29,906 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:29" (1/1) ... [2025-02-06 03:19:29,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:29" (1/1) ... [2025-02-06 03:19:29,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:29" (1/1) ... [2025-02-06 03:19:29,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:29" (1/1) ... [2025-02-06 03:19:29,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:19:29,926 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:19:29,926 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:19:29,926 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:19:29,927 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:29" (1/1) ... [2025-02-06 03:19:29,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:19:29,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:19:29,959 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 03:19:29,965 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 03:19:29,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:19:29,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:19:29,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:19:29,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-02-06 03:19:29,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-02-06 03:19:29,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-02-06 03:19:29,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-02-06 03:19:29,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-02-06 03:19:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:19:29,983 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:19:29,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:19:29,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:19:29,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-06 03:19:29,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:19:29,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:19:29,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-02-06 03:19:29,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-02-06 03:19:29,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-02-06 03:19:29,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-02-06 03:19:29,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:19:29,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:19:29,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 03:19:29,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-06 03:19:29,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-02-06 03:19:29,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-02-06 03:19:30,134 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:19:30,135 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:19:30,661 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem77#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite76#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem78#1;havoc property_#t~ite86#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite85#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem94#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite93#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite109#1;havoc property_#t~mem96#1;havoc property_#t~mem95#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~short99#1;havoc property_#t~ite108#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite107#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem106#1;havoc property_#t~short110#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~short115#1;havoc property_#t~ite130#1;havoc property_#t~mem116#1;havoc property_#t~ite127#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~ite124#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1; [2025-02-06 03:19:30,694 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2025-02-06 03:19:30,694 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:19:30,701 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:19:30,701 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:19:30,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:19:30 BoogieIcfgContainer [2025-02-06 03:19:30,702 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:19:30,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:19:30,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:19:30,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:19:30,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:19:29" (1/3) ... [2025-02-06 03:19:30,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2170a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:19:30, skipping insertion in model container [2025-02-06 03:19:30,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:29" (2/3) ... [2025-02-06 03:19:30,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2170a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:19:30, skipping insertion in model container [2025-02-06 03:19:30,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:19:30" (3/3) ... [2025-02-06 03:19:30,708 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-69.i [2025-02-06 03:19:30,717 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:19:30,719 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-69.i that has 2 procedures, 93 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:19:30,752 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:19:30,761 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;@7325c8ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:19:30,761 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:19:30,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 76 states have internal predecessors, (107), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:19:30,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:19:30,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:30,783 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:30,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:30,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:30,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1657933221, now seen corresponding path program 1 times [2025-02-06 03:19:30,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:30,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925475042] [2025-02-06 03:19:30,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:30,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:30,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:30,803 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:19:30,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 03:19:30,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:19:31,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:19:31,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:31,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:31,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:19:31,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:31,116 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-02-06 03:19:31,117 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:31,117 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:31,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925475042] [2025-02-06 03:19:31,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925475042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:31,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:31,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:19:31,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531209947] [2025-02-06 03:19:31,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:31,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:19:31,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:31,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:19:31,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:19:31,139 INFO L87 Difference]: Start difference. First operand has 93 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 76 states have internal predecessors, (107), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:19:31,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:31,162 INFO L93 Difference]: Finished difference Result 180 states and 284 transitions. [2025-02-06 03:19:31,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:19:31,164 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2025-02-06 03:19:31,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:31,170 INFO L225 Difference]: With dead ends: 180 [2025-02-06 03:19:31,170 INFO L226 Difference]: Without dead ends: 90 [2025-02-06 03:19:31,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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 03:19:31,174 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:31,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:19:31,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-06 03:19:31,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-02-06 03:19:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 73 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:19:31,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2025-02-06 03:19:31,199 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 119 [2025-02-06 03:19:31,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:31,199 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2025-02-06 03:19:31,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:19:31,199 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2025-02-06 03:19:31,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:19:31,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:31,201 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:31,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 03:19:31,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:31,404 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:31,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:31,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2016175906, now seen corresponding path program 1 times [2025-02-06 03:19:31,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:31,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240443579] [2025-02-06 03:19:31,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:31,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:31,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:31,410 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:19:31,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 03:19:31,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:19:31,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:19:31,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:31,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:31,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:19:31,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:31,735 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:19:31,735 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:31,735 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:31,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240443579] [2025-02-06 03:19:31,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240443579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:31,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:31,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:19:31,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326496324] [2025-02-06 03:19:31,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:31,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:19:31,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:31,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:19:31,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:19:31,737 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:31,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:31,781 INFO L93 Difference]: Finished difference Result 179 states and 264 transitions. [2025-02-06 03:19:31,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:19:31,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2025-02-06 03:19:31,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:31,786 INFO L225 Difference]: With dead ends: 179 [2025-02-06 03:19:31,786 INFO L226 Difference]: Without dead ends: 92 [2025-02-06 03:19:31,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:19:31,787 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:31,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 379 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:19:31,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-06 03:19:31,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-06 03:19:31,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:19:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2025-02-06 03:19:31,797 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 119 [2025-02-06 03:19:31,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:31,798 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2025-02-06 03:19:31,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:31,798 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2025-02-06 03:19:31,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:19:31,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:31,804 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:31,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 03:19:32,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:32,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:32,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:32,006 INFO L85 PathProgramCache]: Analyzing trace with hash -2145101472, now seen corresponding path program 1 times [2025-02-06 03:19:32,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:32,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890819632] [2025-02-06 03:19:32,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:32,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:32,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:32,010 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:19:32,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 03:19:32,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:19:32,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:19:32,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:32,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:32,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 03:19:32,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:32,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:32,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 16 [2025-02-06 03:19:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:19:32,945 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:32,945 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:32,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890819632] [2025-02-06 03:19:32,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890819632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:32,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:32,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:19:32,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035535251] [2025-02-06 03:19:32,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:32,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:19:32,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:32,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:19:32,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:19:32,946 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:34,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:34,504 INFO L93 Difference]: Finished difference Result 247 states and 359 transitions. [2025-02-06 03:19:34,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:19:34,508 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2025-02-06 03:19:34,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:34,511 INFO L225 Difference]: With dead ends: 247 [2025-02-06 03:19:34,511 INFO L226 Difference]: Without dead ends: 158 [2025-02-06 03:19:34,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:19:34,513 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 86 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:34,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 932 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 03:19:34,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-06 03:19:34,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2025-02-06 03:19:34,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 130 states have (on average 1.3923076923076922) internal successors, (181), 131 states have internal predecessors, (181), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:19:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 225 transitions. [2025-02-06 03:19:34,525 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 225 transitions. Word has length 121 [2025-02-06 03:19:34,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:34,526 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 225 transitions. [2025-02-06 03:19:34,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 225 transitions. [2025-02-06 03:19:34,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:19:34,529 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:34,529 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:34,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 03:19:34,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:34,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:34,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:34,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1856462817, now seen corresponding path program 1 times [2025-02-06 03:19:34,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:34,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748911323] [2025-02-06 03:19:34,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:34,731 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:34,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:34,734 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:19:34,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 03:19:34,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:19:34,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:19:34,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:34,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:34,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:19:34,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:34,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:35,000 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 34 treesize of output 10 [2025-02-06 03:19:35,011 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:19:35,011 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:35,011 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:35,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748911323] [2025-02-06 03:19:35,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748911323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:35,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:35,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:19:35,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325676437] [2025-02-06 03:19:35,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:35,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:19:35,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:35,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:19:35,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:19:35,013 INFO L87 Difference]: Start difference. First operand 155 states and 225 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:35,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:35,336 INFO L93 Difference]: Finished difference Result 368 states and 534 transitions. [2025-02-06 03:19:35,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:19:35,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2025-02-06 03:19:35,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:35,339 INFO L225 Difference]: With dead ends: 368 [2025-02-06 03:19:35,339 INFO L226 Difference]: Without dead ends: 216 [2025-02-06 03:19:35,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:19:35,344 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 92 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:35,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 484 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:19:35,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-06 03:19:35,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 213. [2025-02-06 03:19:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 178 states have (on average 1.3820224719101124) internal successors, (246), 180 states have internal predecessors, (246), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-06 03:19:35,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 308 transitions. [2025-02-06 03:19:35,366 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 308 transitions. Word has length 121 [2025-02-06 03:19:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:35,367 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 308 transitions. [2025-02-06 03:19:35,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 308 transitions. [2025-02-06 03:19:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:19:35,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:35,368 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:35,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-06 03:19:35,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:35,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:35,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:35,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1305393953, now seen corresponding path program 1 times [2025-02-06 03:19:35,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:35,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746842405] [2025-02-06 03:19:35,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:35,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:35,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:35,573 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:19:35,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-06 03:19:35,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:19:35,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:19:35,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:35,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:35,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:19:35,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:35,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:35,825 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 35 treesize of output 11 [2025-02-06 03:19:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:19:35,839 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:35,839 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:35,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746842405] [2025-02-06 03:19:35,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746842405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:35,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:35,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:19:35,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189814321] [2025-02-06 03:19:35,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:35,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:19:35,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:35,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:19:35,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:19:35,841 INFO L87 Difference]: Start difference. First operand 213 states and 308 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:36,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:36,161 INFO L93 Difference]: Finished difference Result 430 states and 618 transitions. [2025-02-06 03:19:36,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:19:36,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2025-02-06 03:19:36,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:36,163 INFO L225 Difference]: With dead ends: 430 [2025-02-06 03:19:36,163 INFO L226 Difference]: Without dead ends: 220 [2025-02-06 03:19:36,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:19:36,164 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 90 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:36,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 612 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:19:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-06 03:19:36,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 160. [2025-02-06 03:19:36,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 134 states have (on average 1.373134328358209) internal successors, (184), 135 states have internal predecessors, (184), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:19:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 228 transitions. [2025-02-06 03:19:36,172 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 228 transitions. Word has length 121 [2025-02-06 03:19:36,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:36,173 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 228 transitions. [2025-02-06 03:19:36,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:36,173 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 228 transitions. [2025-02-06 03:19:36,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:19:36,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:36,174 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:36,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-02-06 03:19:36,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:36,378 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:36,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:36,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1011990946, now seen corresponding path program 1 times [2025-02-06 03:19:36,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:36,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377827180] [2025-02-06 03:19:36,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:36,379 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:36,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:36,382 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:19:36,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-06 03:19:36,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:19:36,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:19:36,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:36,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:36,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 03:19:36,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:37,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:37,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 16 [2025-02-06 03:19:37,261 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:19:37,261 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:37,261 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:37,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377827180] [2025-02-06 03:19:37,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377827180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:37,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:37,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:19:37,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788457299] [2025-02-06 03:19:37,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:37,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:19:37,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:37,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:19:37,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:19:37,263 INFO L87 Difference]: Start difference. First operand 160 states and 228 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:39,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:39,006 INFO L93 Difference]: Finished difference Result 375 states and 534 transitions. [2025-02-06 03:19:39,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:19:39,009 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2025-02-06 03:19:39,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:39,010 INFO L225 Difference]: With dead ends: 375 [2025-02-06 03:19:39,010 INFO L226 Difference]: Without dead ends: 218 [2025-02-06 03:19:39,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:19:39,012 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 77 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:39,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1114 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-06 03:19:39,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-06 03:19:39,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 166. [2025-02-06 03:19:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.3785714285714286) internal successors, (193), 141 states have internal predecessors, (193), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:19:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 237 transitions. [2025-02-06 03:19:39,032 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 237 transitions. Word has length 121 [2025-02-06 03:19:39,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:39,032 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 237 transitions. [2025-02-06 03:19:39,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 237 transitions. [2025-02-06 03:19:39,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:19:39,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:39,033 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:39,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2025-02-06 03:19:39,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:39,234 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:39,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:39,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1436829353, now seen corresponding path program 1 times [2025-02-06 03:19:39,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:39,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491946326] [2025-02-06 03:19:39,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:39,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:39,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:39,238 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:19:39,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-02-06 03:19:39,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:19:39,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:19:39,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:39,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:39,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 03:19:39,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:39,438 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 20 treesize of output 16 [2025-02-06 03:19:39,471 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 63 treesize of output 51 [2025-02-06 03:19:39,496 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:19:39,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:39,496 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:39,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491946326] [2025-02-06 03:19:39,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491946326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:39,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:39,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:19:39,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526388356] [2025-02-06 03:19:39,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:39,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:19:39,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:39,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:19:39,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:19:39,497 INFO L87 Difference]: Start difference. First operand 166 states and 237 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:39,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:39,693 INFO L93 Difference]: Finished difference Result 382 states and 544 transitions. [2025-02-06 03:19:39,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:19:39,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-02-06 03:19:39,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:39,695 INFO L225 Difference]: With dead ends: 382 [2025-02-06 03:19:39,695 INFO L226 Difference]: Without dead ends: 219 [2025-02-06 03:19:39,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:19:39,696 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 109 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:39,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 988 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:19:39,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-06 03:19:39,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 164. [2025-02-06 03:19:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 139 states have internal predecessors, (190), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:19:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 234 transitions. [2025-02-06 03:19:39,706 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 234 transitions. Word has length 122 [2025-02-06 03:19:39,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:39,707 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 234 transitions. [2025-02-06 03:19:39,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:39,707 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 234 transitions. [2025-02-06 03:19:39,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:19:39,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:39,708 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:39,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-02-06 03:19:39,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:39,909 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:39,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:39,910 INFO L85 PathProgramCache]: Analyzing trace with hash 625305086, now seen corresponding path program 1 times [2025-02-06 03:19:39,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:39,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083344020] [2025-02-06 03:19:39,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:39,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:39,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:39,912 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:19:39,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-02-06 03:19:40,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:19:40,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:19:40,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:40,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:40,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:19:40,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:40,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:40,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 16 [2025-02-06 03:19:40,522 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:19:40,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:40,522 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:40,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083344020] [2025-02-06 03:19:40,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083344020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:40,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:40,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:19:40,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764525728] [2025-02-06 03:19:40,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:40,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:19:40,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:40,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:19:40,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:19:40,523 INFO L87 Difference]: Start difference. First operand 164 states and 234 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:41,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:41,504 INFO L93 Difference]: Finished difference Result 464 states and 666 transitions. [2025-02-06 03:19:41,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:19:41,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-02-06 03:19:41,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:41,510 INFO L225 Difference]: With dead ends: 464 [2025-02-06 03:19:41,510 INFO L226 Difference]: Without dead ends: 303 [2025-02-06 03:19:41,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:19:41,511 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 87 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:41,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 510 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 03:19:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-02-06 03:19:41,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 209. [2025-02-06 03:19:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 183 states have (on average 1.4098360655737705) internal successors, (258), 184 states have internal predecessors, (258), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:19:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 302 transitions. [2025-02-06 03:19:41,524 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 302 transitions. Word has length 122 [2025-02-06 03:19:41,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:41,525 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 302 transitions. [2025-02-06 03:19:41,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 302 transitions. [2025-02-06 03:19:41,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:19:41,526 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:41,526 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:41,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-06 03:19:41,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:41,726 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:41,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:41,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1182149377, now seen corresponding path program 1 times [2025-02-06 03:19:41,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:41,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160409453] [2025-02-06 03:19:41,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:41,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:41,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:41,729 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:19:41,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-02-06 03:19:41,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:19:41,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:19:41,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:41,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:41,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:19:41,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:41,994 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 8 treesize of output 1 [2025-02-06 03:19:42,001 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2025-02-06 03:19:42,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:42,046 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 60 treesize of output 30 [2025-02-06 03:19:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:19:42,074 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:42,074 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:42,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160409453] [2025-02-06 03:19:42,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160409453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:42,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:42,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:19:42,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037553047] [2025-02-06 03:19:42,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:42,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:19:42,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:42,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:19:42,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:19:42,075 INFO L87 Difference]: Start difference. First operand 209 states and 302 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:42,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:42,227 INFO L93 Difference]: Finished difference Result 590 states and 851 transitions. [2025-02-06 03:19:42,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:19:42,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-02-06 03:19:42,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:42,229 INFO L225 Difference]: With dead ends: 590 [2025-02-06 03:19:42,229 INFO L226 Difference]: Without dead ends: 384 [2025-02-06 03:19:42,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:19:42,230 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 76 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:42,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 674 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:19:42,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-02-06 03:19:42,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 380. [2025-02-06 03:19:42,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 342 states have (on average 1.412280701754386) internal successors, (483), 345 states have internal predecessors, (483), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 03:19:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 547 transitions. [2025-02-06 03:19:42,244 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 547 transitions. Word has length 122 [2025-02-06 03:19:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:42,245 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 547 transitions. [2025-02-06 03:19:42,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 547 transitions. [2025-02-06 03:19:42,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:19:42,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:42,246 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:42,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-02-06 03:19:42,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:42,450 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:42,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:42,450 INFO L85 PathProgramCache]: Analyzing trace with hash 211311404, now seen corresponding path program 1 times [2025-02-06 03:19:42,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:42,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882707805] [2025-02-06 03:19:42,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:42,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:42,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:42,453 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:19:42,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-02-06 03:19:42,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:19:42,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:19:42,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:42,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:42,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 03:19:42,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:42,854 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 8 treesize of output 1 [2025-02-06 03:19:43,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:43,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 172 treesize of output 98 [2025-02-06 03:19:43,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:43,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 368 treesize of output 134 [2025-02-06 03:19:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-02-06 03:19:44,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:19:44,358 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:44,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882707805] [2025-02-06 03:19:44,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882707805] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:19:44,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [90873274] [2025-02-06 03:19:44,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:44,358 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:19:44,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:19:44,385 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:19:44,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-02-06 03:19:44,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:19:45,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:19:45,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:45,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:45,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 03:19:45,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:45,264 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 16 treesize of output 17 [2025-02-06 03:19:46,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:46,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 100 [2025-02-06 03:19:47,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:47,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 326 treesize of output 142 [2025-02-06 03:19:47,402 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-02-06 03:19:47,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:19:47,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [90873274] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:19:47,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:19:47,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2025-02-06 03:19:47,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383538516] [2025-02-06 03:19:47,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:19:47,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 03:19:47,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:47,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 03:19:47,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:19:47,538 INFO L87 Difference]: Start difference. First operand 380 states and 547 transitions. Second operand has 18 states, 18 states have (on average 5.944444444444445) internal successors, (107), 17 states have internal predecessors, (107), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-02-06 03:19:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:50,448 INFO L93 Difference]: Finished difference Result 779 states and 1104 transitions. [2025-02-06 03:19:50,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:19:50,449 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.944444444444445) internal successors, (107), 17 states have internal predecessors, (107), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 125 [2025-02-06 03:19:50,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:50,452 INFO L225 Difference]: With dead ends: 779 [2025-02-06 03:19:50,452 INFO L226 Difference]: Without dead ends: 777 [2025-02-06 03:19:50,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 284 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2025-02-06 03:19:50,453 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 450 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:50,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1254 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-06 03:19:50,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2025-02-06 03:19:50,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 771. [2025-02-06 03:19:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 692 states have (on average 1.3959537572254335) internal successors, (966), 702 states have internal predecessors, (966), 64 states have call successors, (64), 14 states have call predecessors, (64), 14 states have return successors, (64), 54 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-06 03:19:50,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1094 transitions. [2025-02-06 03:19:50,503 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1094 transitions. Word has length 125 [2025-02-06 03:19:50,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:50,504 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1094 transitions. [2025-02-06 03:19:50,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.944444444444445) internal successors, (107), 17 states have internal predecessors, (107), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-02-06 03:19:50,504 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1094 transitions. [2025-02-06 03:19:50,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:19:50,506 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:50,507 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:50,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2025-02-06 03:19:50,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-02-06 03:19:50,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:50,911 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:50,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:50,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1427523256, now seen corresponding path program 1 times [2025-02-06 03:19:50,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:50,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277977318] [2025-02-06 03:19:50,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:50,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:50,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:50,914 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:19:50,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-02-06 03:19:50,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:19:51,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:19:51,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:51,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:51,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:19:51,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:51,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:51,212 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 34 treesize of output 10 [2025-02-06 03:19:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:19:51,225 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:51,225 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:51,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277977318] [2025-02-06 03:19:51,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277977318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:51,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:51,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:19:51,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920354014] [2025-02-06 03:19:51,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:51,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:19:51,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:51,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:19:51,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:19:51,226 INFO L87 Difference]: Start difference. First operand 771 states and 1094 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:51,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:51,716 INFO L93 Difference]: Finished difference Result 1774 states and 2500 transitions. [2025-02-06 03:19:51,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:19:51,717 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2025-02-06 03:19:51,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:51,724 INFO L225 Difference]: With dead ends: 1774 [2025-02-06 03:19:51,724 INFO L226 Difference]: Without dead ends: 1006 [2025-02-06 03:19:51,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:19:51,726 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 83 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:51,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 522 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:19:51,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2025-02-06 03:19:51,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 1002. [2025-02-06 03:19:51,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 882 states have (on average 1.3741496598639455) internal successors, (1212), 897 states have internal predecessors, (1212), 96 states have call successors, (96), 23 states have call predecessors, (96), 23 states have return successors, (96), 81 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:19:51,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1404 transitions. [2025-02-06 03:19:51,770 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1404 transitions. Word has length 125 [2025-02-06 03:19:51,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:51,773 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1404 transitions. [2025-02-06 03:19:51,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:51,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1404 transitions. [2025-02-06 03:19:51,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:19:51,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:51,776 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:51,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-02-06 03:19:51,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:51,976 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:51,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:51,977 INFO L85 PathProgramCache]: Analyzing trace with hash -91129863, now seen corresponding path program 1 times [2025-02-06 03:19:51,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:51,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043786078] [2025-02-06 03:19:51,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:51,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:51,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:51,979 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:19:51,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-02-06 03:19:52,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:19:52,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:19:52,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:52,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:52,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:19:52,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:52,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:52,290 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 35 treesize of output 11 [2025-02-06 03:19:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:19:52,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:52,303 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:52,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1043786078] [2025-02-06 03:19:52,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1043786078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:52,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:52,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:19:52,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127741110] [2025-02-06 03:19:52,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:52,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:19:52,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:52,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:19:52,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:19:52,304 INFO L87 Difference]: Start difference. First operand 1002 states and 1404 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:52,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:52,893 INFO L93 Difference]: Finished difference Result 2186 states and 3045 transitions. [2025-02-06 03:19:52,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:19:52,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2025-02-06 03:19:52,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:52,898 INFO L225 Difference]: With dead ends: 2186 [2025-02-06 03:19:52,898 INFO L226 Difference]: Without dead ends: 1214 [2025-02-06 03:19:52,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:19:52,899 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 92 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:52,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 820 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:19:52,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2025-02-06 03:19:52,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1194. [2025-02-06 03:19:52,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1038 states have (on average 1.3603082851637764) internal successors, (1412), 1059 states have internal predecessors, (1412), 124 states have call successors, (124), 31 states have call predecessors, (124), 31 states have return successors, (124), 103 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-06 03:19:52,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1660 transitions. [2025-02-06 03:19:52,957 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1660 transitions. Word has length 125 [2025-02-06 03:19:52,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:52,957 INFO L471 AbstractCegarLoop]: Abstraction has 1194 states and 1660 transitions. [2025-02-06 03:19:52,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:52,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1660 transitions. [2025-02-06 03:19:52,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:19:52,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:52,959 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:52,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-02-06 03:19:53,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:53,160 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:53,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:53,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1267420730, now seen corresponding path program 1 times [2025-02-06 03:19:53,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:53,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973283452] [2025-02-06 03:19:53,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:53,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:53,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:53,163 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:19:53,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-02-06 03:19:53,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:19:53,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:19:53,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:53,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:53,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 03:19:53,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:53,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:53,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 14 [2025-02-06 03:19:57,900 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:19:57,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:57,900 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:57,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973283452] [2025-02-06 03:19:57,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973283452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:57,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:57,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:19:57,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210029288] [2025-02-06 03:19:57,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:57,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:19:57,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:57,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:19:57,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=28, Unknown=1, NotChecked=0, Total=42 [2025-02-06 03:19:57,902 INFO L87 Difference]: Start difference. First operand 1194 states and 1660 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:59,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:59,519 INFO L93 Difference]: Finished difference Result 2676 states and 3703 transitions. [2025-02-06 03:19:59,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:19:59,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2025-02-06 03:19:59,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:59,526 INFO L225 Difference]: With dead ends: 2676 [2025-02-06 03:19:59,526 INFO L226 Difference]: Without dead ends: 1512 [2025-02-06 03:19:59,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2025-02-06 03:19:59,529 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 86 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:59,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 574 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 03:19:59,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-06 03:19:59,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1341. [2025-02-06 03:19:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1182 states have (on average 1.3671742808798646) internal successors, (1616), 1204 states have internal predecessors, (1616), 124 states have call successors, (124), 34 states have call predecessors, (124), 34 states have return successors, (124), 102 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-06 03:19:59,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1864 transitions. [2025-02-06 03:19:59,579 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1864 transitions. Word has length 125 [2025-02-06 03:19:59,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:59,580 INFO L471 AbstractCegarLoop]: Abstraction has 1341 states and 1864 transitions. [2025-02-06 03:19:59,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:19:59,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1864 transitions. [2025-02-06 03:19:59,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:19:59,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:59,582 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:19:59,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-02-06 03:19:59,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:59,783 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:59,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:59,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1396503449, now seen corresponding path program 1 times [2025-02-06 03:19:59,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:59,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693520441] [2025-02-06 03:19:59,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:59,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:59,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:59,790 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:19:59,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2025-02-06 03:19:59,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:20:00,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:20:00,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:00,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:00,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:20:00,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:20:00,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:20:00,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 15 [2025-02-06 03:20:00,426 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:20:00,426 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:20:00,426 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:20:00,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693520441] [2025-02-06 03:20:00,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693520441] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:20:00,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:20:00,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:20:00,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972532009] [2025-02-06 03:20:00,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:20:00,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:20:00,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:20:00,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:20:00,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:20:00,428 INFO L87 Difference]: Start difference. First operand 1341 states and 1864 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:20:01,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:20:01,770 INFO L93 Difference]: Finished difference Result 2708 states and 3753 transitions. [2025-02-06 03:20:01,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:20:01,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2025-02-06 03:20:01,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:20:01,779 INFO L225 Difference]: With dead ends: 2708 [2025-02-06 03:20:01,779 INFO L226 Difference]: Without dead ends: 1370 [2025-02-06 03:20:01,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:20:01,782 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 89 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:20:01,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 572 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 03:20:01,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2025-02-06 03:20:01,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1137. [2025-02-06 03:20:01,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 1006 states have (on average 1.363817097415507) internal successors, (1372), 1022 states have internal predecessors, (1372), 100 states have call successors, (100), 30 states have call predecessors, (100), 30 states have return successors, (100), 84 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-06 03:20:01,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1572 transitions. [2025-02-06 03:20:01,840 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1572 transitions. Word has length 125 [2025-02-06 03:20:01,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:20:01,840 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1572 transitions. [2025-02-06 03:20:01,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:20:01,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1572 transitions. [2025-02-06 03:20:01,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:20:01,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:01,842 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:20:01,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2025-02-06 03:20:02,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:20:02,043 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:02,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:02,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1685304793, now seen corresponding path program 1 times [2025-02-06 03:20:02,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:20:02,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960727688] [2025-02-06 03:20:02,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:02,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:20:02,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:20:02,047 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:20:02,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2025-02-06 03:20:02,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:20:02,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:20:02,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:02,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:02,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:20:02,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:20:02,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:20:02,354 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 35 treesize of output 11 [2025-02-06 03:20:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:20:02,366 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:20:02,366 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:20:02,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960727688] [2025-02-06 03:20:02,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960727688] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:20:02,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:20:02,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:20:02,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610852095] [2025-02-06 03:20:02,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:20:02,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:20:02,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:20:02,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:20:02,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:20:02,368 INFO L87 Difference]: Start difference. First operand 1137 states and 1572 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:20:02,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:20:02,842 INFO L93 Difference]: Finished difference Result 2300 states and 3155 transitions. [2025-02-06 03:20:02,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:20:02,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2025-02-06 03:20:02,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:20:02,846 INFO L225 Difference]: With dead ends: 2300 [2025-02-06 03:20:02,846 INFO L226 Difference]: Without dead ends: 1166 [2025-02-06 03:20:02,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:20:02,848 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 95 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:20:02,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 665 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:20:02,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2025-02-06 03:20:02,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1005. [2025-02-06 03:20:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 887 states have (on average 1.3562570462232244) internal successors, (1203), 900 states have internal predecessors, (1203), 90 states have call successors, (90), 27 states have call predecessors, (90), 27 states have return successors, (90), 77 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-06 03:20:02,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1383 transitions. [2025-02-06 03:20:02,901 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1383 transitions. Word has length 125 [2025-02-06 03:20:02,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:20:02,901 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1383 transitions. [2025-02-06 03:20:02,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:20:02,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1383 transitions. [2025-02-06 03:20:02,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:20:02,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:02,903 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:20:02,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2025-02-06 03:20:03,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:20:03,104 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:03,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:03,104 INFO L85 PathProgramCache]: Analyzing trace with hash 770921943, now seen corresponding path program 1 times [2025-02-06 03:20:03,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:20:03,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036685316] [2025-02-06 03:20:03,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:03,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:20:03,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:20:03,107 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:20:03,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2025-02-06 03:20:03,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:20:03,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:20:03,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:03,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:03,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 03:20:03,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:20:04,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:20:04,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 15 [2025-02-06 03:20:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:20:08,246 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:20:08,246 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:20:08,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036685316] [2025-02-06 03:20:08,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036685316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:20:08,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:20:08,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:20:08,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072582143] [2025-02-06 03:20:08,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:20:08,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:20:08,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:20:08,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:20:08,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=28, Unknown=1, NotChecked=0, Total=42 [2025-02-06 03:20:08,247 INFO L87 Difference]: Start difference. First operand 1005 states and 1383 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:20:13,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:20:14,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:20:14,473 INFO L93 Difference]: Finished difference Result 2093 states and 2871 transitions. [2025-02-06 03:20:14,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:20:14,475 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2025-02-06 03:20:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:20:14,479 INFO L225 Difference]: With dead ends: 2093 [2025-02-06 03:20:14,479 INFO L226 Difference]: Without dead ends: 1091 [2025-02-06 03:20:14,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2025-02-06 03:20:14,481 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 82 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:20:14,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 826 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2025-02-06 03:20:14,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2025-02-06 03:20:14,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1005. [2025-02-06 03:20:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 887 states have (on average 1.3517474633596391) internal successors, (1199), 900 states have internal predecessors, (1199), 90 states have call successors, (90), 27 states have call predecessors, (90), 27 states have return successors, (90), 77 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-06 03:20:14,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1379 transitions. [2025-02-06 03:20:14,522 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1379 transitions. Word has length 125 [2025-02-06 03:20:14,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:20:14,523 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1379 transitions. [2025-02-06 03:20:14,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:20:14,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1379 transitions. [2025-02-06 03:20:14,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:20:14,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:14,526 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:20:14,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2025-02-06 03:20:14,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:20:14,727 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:14,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:14,727 INFO L85 PathProgramCache]: Analyzing trace with hash -317054197, now seen corresponding path program 1 times [2025-02-06 03:20:14,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:20:14,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90670142] [2025-02-06 03:20:14,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:14,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:20:14,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:20:14,730 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:20:14,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2025-02-06 03:20:14,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:20:14,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:20:14,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:14,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:14,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:20:14,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:20:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-02-06 03:20:14,946 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:20:14,946 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:20:14,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90670142] [2025-02-06 03:20:14,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90670142] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:20:14,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:20:14,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:20:14,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783211196] [2025-02-06 03:20:14,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:20:14,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:20:14,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:20:14,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:20:14,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:20:14,949 INFO L87 Difference]: Start difference. First operand 1005 states and 1379 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:20:15,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:20:15,043 INFO L93 Difference]: Finished difference Result 2007 states and 2755 transitions. [2025-02-06 03:20:15,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:20:15,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 125 [2025-02-06 03:20:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:20:15,047 INFO L225 Difference]: With dead ends: 2007 [2025-02-06 03:20:15,047 INFO L226 Difference]: Without dead ends: 1005 [2025-02-06 03:20:15,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:20:15,049 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:20:15,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 379 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:20:15,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2025-02-06 03:20:15,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 1005. [2025-02-06 03:20:15,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 887 states have (on average 1.346110484780158) internal successors, (1194), 900 states have internal predecessors, (1194), 90 states have call successors, (90), 27 states have call predecessors, (90), 27 states have return successors, (90), 77 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-06 03:20:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1374 transitions. [2025-02-06 03:20:15,087 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1374 transitions. Word has length 125 [2025-02-06 03:20:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:20:15,087 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1374 transitions. [2025-02-06 03:20:15,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:20:15,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1374 transitions. [2025-02-06 03:20:15,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 03:20:15,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:15,089 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:20:15,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2025-02-06 03:20:15,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:20:15,290 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:15,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:15,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1802300530, now seen corresponding path program 1 times [2025-02-06 03:20:15,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:20:15,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829610775] [2025-02-06 03:20:15,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:15,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:20:15,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:20:15,293 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:20:15,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2025-02-06 03:20:15,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:20:15,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:20:15,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:15,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:15,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 03:20:15,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:20:15,642 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 8 treesize of output 1 [2025-02-06 03:20:16,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:20:16,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 170 treesize of output 96 [2025-02-06 03:20:16,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:20:16,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 366 treesize of output 132 [2025-02-06 03:20:16,671 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 10 proven. 206 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-02-06 03:20:16,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:20:16,930 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:20:16,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829610775] [2025-02-06 03:20:16,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829610775] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:20:16,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1022289093] [2025-02-06 03:20:16,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:16,931 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:20:16,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:20:16,934 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:20:16,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2025-02-06 03:20:17,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:20:17,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:20:17,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:17,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:17,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 03:20:17,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:20:17,891 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 16 treesize of output 17 [2025-02-06 03:20:24,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:20:24,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 98 [2025-02-06 03:20:25,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:20:25,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 324 treesize of output 140 [2025-02-06 03:20:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 10 proven. 206 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-02-06 03:20:25,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:20:25,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1022289093] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:20:25,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:20:25,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 24 [2025-02-06 03:20:25,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068742237] [2025-02-06 03:20:25,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:20:25,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 03:20:25,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:20:25,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 03:20:25,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=756, Unknown=1, NotChecked=0, Total=870 [2025-02-06 03:20:25,396 INFO L87 Difference]: Start difference. First operand 1005 states and 1374 transitions. Second operand has 25 states, 23 states have (on average 5.086956521739131) internal successors, (117), 22 states have internal predecessors, (117), 6 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 4 states have call predecessors, (30), 6 states have call successors, (30) [2025-02-06 03:20:31,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:20:35,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:20:35,401 INFO L93 Difference]: Finished difference Result 1549 states and 2098 transitions. [2025-02-06 03:20:35,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 03:20:35,402 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 5.086956521739131) internal successors, (117), 22 states have internal predecessors, (117), 6 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 4 states have call predecessors, (30), 6 states have call successors, (30) Word has length 127 [2025-02-06 03:20:35,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:20:35,412 INFO L225 Difference]: With dead ends: 1549 [2025-02-06 03:20:35,412 INFO L226 Difference]: Without dead ends: 1547 [2025-02-06 03:20:35,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 281 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=394, Invalid=1861, Unknown=1, NotChecked=0, Total=2256 [2025-02-06 03:20:35,418 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 450 mSDsluCounter, 2305 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 111 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 2506 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:20:35,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 2506 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1212 Invalid, 1 Unknown, 0 Unchecked, 8.9s Time] [2025-02-06 03:20:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2025-02-06 03:20:35,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1030. [2025-02-06 03:20:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 903 states have (on average 1.3399778516057586) internal successors, (1210), 918 states have internal predecessors, (1210), 97 states have call successors, (97), 29 states have call predecessors, (97), 29 states have return successors, (97), 82 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-06 03:20:35,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1404 transitions. [2025-02-06 03:20:35,506 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1404 transitions. Word has length 127 [2025-02-06 03:20:35,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:20:35,506 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1404 transitions. [2025-02-06 03:20:35,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 5.086956521739131) internal successors, (117), 22 states have internal predecessors, (117), 6 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 4 states have call predecessors, (30), 6 states have call successors, (30) [2025-02-06 03:20:35,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1404 transitions. [2025-02-06 03:20:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 03:20:35,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:35,508 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:20:35,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2025-02-06 03:20:35,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2025-02-06 03:20:35,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:20:35,917 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:35,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:35,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1126607921, now seen corresponding path program 1 times [2025-02-06 03:20:35,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:20:35,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121828439] [2025-02-06 03:20:35,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:35,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:20:35,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:20:35,920 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:20:35,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2025-02-06 03:20:36,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:20:36,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:20:36,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:36,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:36,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:20:36,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:20:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-02-06 03:20:36,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:20:36,146 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:20:36,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121828439] [2025-02-06 03:20:36,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121828439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:20:36,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:20:36,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:20:36,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392313930] [2025-02-06 03:20:36,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:20:36,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:20:36,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:20:36,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:20:36,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:20:36,147 INFO L87 Difference]: Start difference. First operand 1030 states and 1404 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-06 03:20:36,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:20:36,309 INFO L93 Difference]: Finished difference Result 1625 states and 2189 transitions. [2025-02-06 03:20:36,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:20:36,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 127 [2025-02-06 03:20:36,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:20:36,312 INFO L225 Difference]: With dead ends: 1625 [2025-02-06 03:20:36,312 INFO L226 Difference]: Without dead ends: 577 [2025-02-06 03:20:36,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:20:36,313 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:20:36,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 528 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:20:36,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-02-06 03:20:36,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 559. [2025-02-06 03:20:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 488 states have (on average 1.319672131147541) internal successors, (644), 494 states have internal predecessors, (644), 52 states have call successors, (52), 18 states have call predecessors, (52), 18 states have return successors, (52), 46 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:20:36,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 748 transitions. [2025-02-06 03:20:36,345 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 748 transitions. Word has length 127 [2025-02-06 03:20:36,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:20:36,345 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 748 transitions. [2025-02-06 03:20:36,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-06 03:20:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 748 transitions. [2025-02-06 03:20:36,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 03:20:36,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:36,346 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:20:36,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2025-02-06 03:20:36,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:20:36,547 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:36,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:36,547 INFO L85 PathProgramCache]: Analyzing trace with hash 555145362, now seen corresponding path program 1 times [2025-02-06 03:20:36,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:20:36,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061087668] [2025-02-06 03:20:36,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:36,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:20:36,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:20:36,549 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:20:36,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2025-02-06 03:20:36,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:20:36,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:20:36,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:36,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:36,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 03:20:36,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:20:36,897 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 93 treesize of output 75 [2025-02-06 03:20:36,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:20:36,901 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 75 treesize of output 45 [2025-02-06 03:20:36,935 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:20:36,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:20:36,936 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:20:36,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061087668] [2025-02-06 03:20:36,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061087668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:20:36,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:20:36,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:20:36,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979949148] [2025-02-06 03:20:36,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:20:36,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:20:36,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:20:36,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:20:36,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:20:36,938 INFO L87 Difference]: Start difference. First operand 559 states and 748 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:20:37,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:20:37,467 INFO L93 Difference]: Finished difference Result 1308 states and 1728 transitions. [2025-02-06 03:20:37,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:20:37,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-02-06 03:20:37,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:20:37,471 INFO L225 Difference]: With dead ends: 1308 [2025-02-06 03:20:37,471 INFO L226 Difference]: Without dead ends: 761 [2025-02-06 03:20:37,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:20:37,472 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 34 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:20:37,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 445 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:20:37,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-02-06 03:20:37,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 707. [2025-02-06 03:20:37,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 636 states have (on average 1.2971698113207548) internal successors, (825), 642 states have internal predecessors, (825), 52 states have call successors, (52), 18 states have call predecessors, (52), 18 states have return successors, (52), 46 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:20:37,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 929 transitions. [2025-02-06 03:20:37,509 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 929 transitions. Word has length 127 [2025-02-06 03:20:37,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:20:37,510 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 929 transitions. [2025-02-06 03:20:37,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:20:37,510 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 929 transitions. [2025-02-06 03:20:37,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 03:20:37,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:37,511 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:20:37,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2025-02-06 03:20:37,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:20:37,715 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:37,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:37,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1060288069, now seen corresponding path program 1 times [2025-02-06 03:20:37,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:20:37,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216834374] [2025-02-06 03:20:37,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:37,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:20:37,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:20:37,719 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:20:37,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2025-02-06 03:20:37,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:20:37,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:20:37,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:37,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:37,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 03:20:37,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:20:38,003 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 12 treesize of output 8 [2025-02-06 03:20:38,177 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2025-02-06 03:20:38,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:20:38,276 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 68 treesize of output 34 [2025-02-06 03:20:38,313 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:20:38,314 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:20:38,314 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:20:38,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216834374] [2025-02-06 03:20:38,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1216834374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:20:38,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:20:38,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:20:38,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877770303] [2025-02-06 03:20:38,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:20:38,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:20:38,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:20:38,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:20:38,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:20:38,315 INFO L87 Difference]: Start difference. First operand 707 states and 929 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:20:38,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:20:38,700 INFO L93 Difference]: Finished difference Result 1441 states and 1884 transitions. [2025-02-06 03:20:38,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:20:38,701 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2025-02-06 03:20:38,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:20:38,703 INFO L225 Difference]: With dead ends: 1441 [2025-02-06 03:20:38,703 INFO L226 Difference]: Without dead ends: 746 [2025-02-06 03:20:38,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:20:38,704 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 158 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:20:38,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 741 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:20:38,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-02-06 03:20:38,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 717. [2025-02-06 03:20:38,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 646 states have (on average 1.2925696594427245) internal successors, (835), 652 states have internal predecessors, (835), 52 states have call successors, (52), 18 states have call predecessors, (52), 18 states have return successors, (52), 46 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:20:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 939 transitions. [2025-02-06 03:20:38,739 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 939 transitions. Word has length 127 [2025-02-06 03:20:38,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:20:38,739 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 939 transitions. [2025-02-06 03:20:38,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:20:38,739 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 939 transitions. [2025-02-06 03:20:38,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 03:20:38,740 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:38,740 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:20:38,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2025-02-06 03:20:38,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:20:38,945 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:38,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:38,946 INFO L85 PathProgramCache]: Analyzing trace with hash 389605176, now seen corresponding path program 1 times [2025-02-06 03:20:38,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:20:38,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945947083] [2025-02-06 03:20:38,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:38,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:20:38,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:20:38,949 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:20:38,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2025-02-06 03:20:39,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:20:39,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:20:39,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:39,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:39,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 03:20:39,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:20:39,285 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 18 treesize of output 19 [2025-02-06 03:20:40,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:20:40,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 190 treesize of output 106 [2025-02-06 03:20:41,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:20:41,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 359 treesize of output 151 [2025-02-06 03:20:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-02-06 03:20:41,157 INFO L312 TraceCheckSpWp]: Computing backward predicates...