./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-p_file-46.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 4a633b68302485b97355fcc8c9ab86b75c4bb68dbf6f93417fd79b2d2487527c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:46:54,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:46:54,492 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:46:54,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:46:54,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:46:54,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:46:54,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:46:54,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:46:54,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:46:54,522 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:46:54,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:46:54,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:46:54,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:46:54,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:46:54,522 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:46:54,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:46:54,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:46:54,522 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:46:54,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:46:54,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:46:54,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:46:54,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:46:54,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:46:54,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:46:54,523 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:46:54,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:46:54,523 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:46:54,523 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:46:54,523 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:46:54,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:46:54,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:46:54,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:46:54,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:46:54,523 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:46:54,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:46:54,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:46:54,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:46:54,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:46:54,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:46:54,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:46:54,523 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:46:54,523 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:46:54,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:46:54,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:46:54,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:46:54,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:46:54,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:46:54,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:46:54,524 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 -> 4a633b68302485b97355fcc8c9ab86b75c4bb68dbf6f93417fd79b2d2487527c [2025-01-09 15:46:54,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:46:54,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:46:54,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:46:54,788 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:46:54,789 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:46:54,789 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-p_file-46.i [2025-01-09 15:46:55,958 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2eece0037/2534bcdad29a4ec28e6b4a2932bd83a3/FLAGf3b6b2d10 [2025-01-09 15:46:56,190 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:46:56,190 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-46.i [2025-01-09 15:46:56,200 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2eece0037/2534bcdad29a4ec28e6b4a2932bd83a3/FLAGf3b6b2d10 [2025-01-09 15:46:56,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2eece0037/2534bcdad29a4ec28e6b4a2932bd83a3 [2025-01-09 15:46:56,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:46:56,534 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:46:56,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:46:56,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:46:56,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:46:56,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:46:56" (1/1) ... [2025-01-09 15:46:56,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef8b610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:56, skipping insertion in model container [2025-01-09 15:46:56,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:46:56" (1/1) ... [2025-01-09 15:46:56,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:46:56,661 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-p_file-46.i[916,929] [2025-01-09 15:46:56,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:46:56,710 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:46:56,717 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-p_file-46.i[916,929] [2025-01-09 15:46:56,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:46:56,747 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:46:56,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:56 WrapperNode [2025-01-09 15:46:56,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:46:56,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:46:56,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:46:56,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:46:56,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:56" (1/1) ... [2025-01-09 15:46:56,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:56" (1/1) ... [2025-01-09 15:46:56,785 INFO L138 Inliner]: procedures = 29, calls = 137, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 424 [2025-01-09 15:46:56,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:46:56,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:46:56,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:46:56,788 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:46:56,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:56" (1/1) ... [2025-01-09 15:46:56,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:56" (1/1) ... [2025-01-09 15:46:56,797 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:56" (1/1) ... [2025-01-09 15:46:56,821 INFO L175 MemorySlicer]: Split 101 memory accesses to 12 slices as follows [2, 12, 8, 17, 8, 8, 3, 6, 6, 8, 17, 6]. 17 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 5, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1]. [2025-01-09 15:46:56,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:56" (1/1) ... [2025-01-09 15:46:56,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:56" (1/1) ... [2025-01-09 15:46:56,836 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:56" (1/1) ... [2025-01-09 15:46:56,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:56" (1/1) ... [2025-01-09 15:46:56,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:56" (1/1) ... [2025-01-09 15:46:56,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:56" (1/1) ... [2025-01-09 15:46:56,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:56" (1/1) ... [2025-01-09 15:46:56,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:46:56,862 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:46:56,863 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:46:56,863 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:46:56,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:56" (1/1) ... [2025-01-09 15:46:56,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:46:56,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:46:56,888 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-01-09 15:46:56,894 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-01-09 15:46:56,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:46:56,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:46:56,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:46:56,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:46:56,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:46:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:46:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:46:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-01-09 15:46:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-01-09 15:46:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-01-09 15:46:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-01-09 15:46:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-01-09 15:46:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-01-09 15:46:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:46:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:46:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:46:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:46:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:46:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:46:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 15:46:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 15:46:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 15:46:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 15:46:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 15:46:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 15:46:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:46:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:46:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-01-09 15:46:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:46:56,912 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:46:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:46:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:46:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:46:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:46:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:46:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:46:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 15:46:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 15:46:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 15:46:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 15:46:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 15:46:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 15:46:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:46:56,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:46:57,064 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:46:57,065 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:46:57,451 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2025-01-09 15:46:57,451 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:46:57,461 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:46:57,461 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:46:57,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:46:57 BoogieIcfgContainer [2025-01-09 15:46:57,461 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:46:57,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:46:57,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:46:57,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:46:57,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:46:56" (1/3) ... [2025-01-09 15:46:57,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293247ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:46:57, skipping insertion in model container [2025-01-09 15:46:57,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:56" (2/3) ... [2025-01-09 15:46:57,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293247ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:46:57, skipping insertion in model container [2025-01-09 15:46:57,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:46:57" (3/3) ... [2025-01-09 15:46:57,471 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-46.i [2025-01-09 15:46:57,482 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:46:57,483 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-46.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:46:57,527 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:46:57,536 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;@26d465c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:46:57,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:46:57,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:46:57,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:46:57,547 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:46:57,548 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:46:57,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:46:57,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:46:57,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1625227802, now seen corresponding path program 1 times [2025-01-09 15:46:57,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:46:57,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771106245] [2025-01-09 15:46:57,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:46:57,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:46:57,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:46:57,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:46:57,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:46:57,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:46:57,876 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 15:46:57,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:46:57,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771106245] [2025-01-09 15:46:57,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771106245] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:46:57,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86814834] [2025-01-09 15:46:57,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:46:57,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:46:57,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:46:57,884 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-01-09 15:46:57,888 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-01-09 15:46:58,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:46:58,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:46:58,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:46:58,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:46:58,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:46:58,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:46:58,159 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 15:46:58,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:46:58,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86814834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:46:58,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:46:58,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:46:58,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339221050] [2025-01-09 15:46:58,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:46:58,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:46:58,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:46:58,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:46:58,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:46:58,183 INFO L87 Difference]: Start difference. First operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:46:58,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:46:58,204 INFO L93 Difference]: Finished difference Result 194 states and 299 transitions. [2025-01-09 15:46:58,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:46:58,205 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2025-01-09 15:46:58,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:46:58,212 INFO L225 Difference]: With dead ends: 194 [2025-01-09 15:46:58,212 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 15:46:58,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 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-01-09 15:46:58,218 INFO L435 NwaCegarLoop]: 140 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, 140 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-01-09 15:46:58,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:46:58,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 15:46:58,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 15:46:58,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.382716049382716) internal successors, (112), 81 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:46:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2025-01-09 15:46:58,253 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 116 [2025-01-09 15:46:58,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:46:58,253 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2025-01-09 15:46:58,254 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:46:58,254 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2025-01-09 15:46:58,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:46:58,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:46:58,256 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:46:58,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 15:46:58,460 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-01-09 15:46:58,461 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:46:58,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:46:58,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1404338430, now seen corresponding path program 1 times [2025-01-09 15:46:58,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:46:58,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317319578] [2025-01-09 15:46:58,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:46:58,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:46:58,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:46:58,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:46:58,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:46:58,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:46:59,090 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:46:59,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:46:59,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317319578] [2025-01-09 15:46:59,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317319578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:46:59,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:46:59,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:46:59,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898981958] [2025-01-09 15:46:59,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:46:59,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:46:59,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:46:59,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:46:59,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:46:59,092 INFO L87 Difference]: Start difference. First operand 97 states and 140 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:46:59,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:46:59,205 INFO L93 Difference]: Finished difference Result 287 states and 417 transitions. [2025-01-09 15:46:59,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:46:59,206 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-01-09 15:46:59,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:46:59,208 INFO L225 Difference]: With dead ends: 287 [2025-01-09 15:46:59,208 INFO L226 Difference]: Without dead ends: 193 [2025-01-09 15:46:59,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:46:59,209 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 129 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:46:59,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 499 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:46:59,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-09 15:46:59,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 109. [2025-01-09 15:46:59,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:46:59,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-01-09 15:46:59,229 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 116 [2025-01-09 15:46:59,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:46:59,230 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-01-09 15:46:59,230 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:46:59,230 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-01-09 15:46:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 15:46:59,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:46:59,232 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:46:59,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:46:59,232 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:46:59,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:46:59,233 INFO L85 PathProgramCache]: Analyzing trace with hash 516874457, now seen corresponding path program 1 times [2025-01-09 15:46:59,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:46:59,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276863857] [2025-01-09 15:46:59,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:46:59,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:46:59,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 15:46:59,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 15:46:59,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:46:59,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:46:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:46:59,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:46:59,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276863857] [2025-01-09 15:46:59,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276863857] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:46:59,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:46:59,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:46:59,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467419490] [2025-01-09 15:46:59,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:46:59,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:46:59,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:46:59,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:46:59,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:46:59,374 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:46:59,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:46:59,449 INFO L93 Difference]: Finished difference Result 267 states and 382 transitions. [2025-01-09 15:46:59,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:46:59,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-01-09 15:46:59,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:46:59,452 INFO L225 Difference]: With dead ends: 267 [2025-01-09 15:46:59,454 INFO L226 Difference]: Without dead ends: 161 [2025-01-09 15:46:59,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-01-09 15:46:59,455 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 63 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:46:59,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 494 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:46:59,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-09 15:46:59,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2025-01-09 15:46:59,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 140 states have (on average 1.3928571428571428) internal successors, (195), 141 states have internal predecessors, (195), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:46:59,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 225 transitions. [2025-01-09 15:46:59,471 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 225 transitions. Word has length 118 [2025-01-09 15:46:59,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:46:59,471 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 225 transitions. [2025-01-09 15:46:59,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:46:59,471 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 225 transitions. [2025-01-09 15:46:59,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 15:46:59,472 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:46:59,475 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:46:59,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:46:59,475 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:46:59,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:46:59,476 INFO L85 PathProgramCache]: Analyzing trace with hash 123847447, now seen corresponding path program 1 times [2025-01-09 15:46:59,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:46:59,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879505338] [2025-01-09 15:46:59,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:46:59,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:46:59,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 15:46:59,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 15:46:59,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:46:59,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:46:59,699 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 15:46:59,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:46:59,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879505338] [2025-01-09 15:46:59,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879505338] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:46:59,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517329911] [2025-01-09 15:46:59,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:46:59,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:46:59,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:46:59,704 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-01-09 15:46:59,706 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-01-09 15:46:59,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 15:46:59,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 15:46:59,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:46:59,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:46:59,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:46:59,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:46:59,919 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:46:59,919 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:46:59,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517329911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:46:59,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:46:59,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 15:46:59,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140230446] [2025-01-09 15:46:59,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:46:59,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:46:59,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:46:59,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:46:59,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:46:59,921 INFO L87 Difference]: Start difference. First operand 158 states and 225 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:46:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:46:59,954 INFO L93 Difference]: Finished difference Result 318 states and 454 transitions. [2025-01-09 15:46:59,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:46:59,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-01-09 15:46:59,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:46:59,957 INFO L225 Difference]: With dead ends: 318 [2025-01-09 15:46:59,957 INFO L226 Difference]: Without dead ends: 163 [2025-01-09 15:46:59,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:46:59,960 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:46:59,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 531 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:46:59,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-01-09 15:46:59,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-01-09 15:46:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 145 states have (on average 1.3793103448275863) internal successors, (200), 146 states have internal predecessors, (200), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:46:59,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 230 transitions. [2025-01-09 15:46:59,971 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 230 transitions. Word has length 118 [2025-01-09 15:46:59,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:46:59,972 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 230 transitions. [2025-01-09 15:46:59,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:46:59,972 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 230 transitions. [2025-01-09 15:46:59,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 15:46:59,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:46:59,973 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:46:59,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 15:47:00,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:47:00,174 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:00,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:00,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1796738135, now seen corresponding path program 1 times [2025-01-09 15:47:00,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:47:00,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382118734] [2025-01-09 15:47:00,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:00,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:47:00,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 15:47:00,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 15:47:00,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:00,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:47:00,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:47:00,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382118734] [2025-01-09 15:47:00,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382118734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:47:00,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:47:00,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:47:00,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943700590] [2025-01-09 15:47:00,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:47:00,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:47:00,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:47:00,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:47:00,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:47:00,747 INFO L87 Difference]: Start difference. First operand 163 states and 230 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:47:01,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:47:01,051 INFO L93 Difference]: Finished difference Result 560 states and 792 transitions. [2025-01-09 15:47:01,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:47:01,051 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2025-01-09 15:47:01,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:47:01,053 INFO L225 Difference]: With dead ends: 560 [2025-01-09 15:47:01,053 INFO L226 Difference]: Without dead ends: 400 [2025-01-09 15:47:01,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:47:01,056 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 544 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:47:01,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 790 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:47:01,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-01-09 15:47:01,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 344. [2025-01-09 15:47:01,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 309 states have (on average 1.3915857605177993) internal successors, (430), 311 states have internal predecessors, (430), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:47:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 490 transitions. [2025-01-09 15:47:01,086 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 490 transitions. Word has length 118 [2025-01-09 15:47:01,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:47:01,087 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 490 transitions. [2025-01-09 15:47:01,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:47:01,088 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 490 transitions. [2025-01-09 15:47:01,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 15:47:01,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:01,090 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:47:01,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:47:01,090 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:01,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:01,091 INFO L85 PathProgramCache]: Analyzing trace with hash -524508087, now seen corresponding path program 1 times [2025-01-09 15:47:01,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:47:01,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557001120] [2025-01-09 15:47:01,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:01,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:47:01,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 15:47:01,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 15:47:01,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:01,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:47:01,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1142011458] [2025-01-09 15:47:01,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:01,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:47:01,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:47:01,205 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-01-09 15:47:01,216 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-01-09 15:47:01,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 15:47:01,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 15:47:01,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:01,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:01,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 15:47:01,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:47:01,847 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 15 treesize of output 1 [2025-01-09 15:47:02,676 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 17 treesize of output 9 [2025-01-09 15:47:02,757 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 77 treesize of output 45 [2025-01-09 15:47:37,682 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 64 treesize of output 48 [2025-01-09 15:47:46,902 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 8 proven. 204 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-01-09 15:47:46,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:48:09,017 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 88 treesize of output 68 [2025-01-09 15:48:09,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:09,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557001120] [2025-01-09 15:48:09,643 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 15:48:09,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142011458] [2025-01-09 15:48:09,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142011458] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:48:09,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:48:09,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2025-01-09 15:48:09,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612685431] [2025-01-09 15:48:09,643 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 15:48:09,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:48:09,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:09,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:48:09,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=404, Unknown=11, NotChecked=0, Total=506 [2025-01-09 15:48:09,646 INFO L87 Difference]: Start difference. First operand 344 states and 490 transitions. Second operand has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:48:18,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-09 15:48:22,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-09 15:48:27,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-09 15:48:31,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-09 15:48:35,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-09 15:48:40,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0]