./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-37.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-s_file-37.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 e1208277e71e1c3dcb7bf16b04051e4f527abbe326e9bfc724844bd2d70dc86a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:50:57,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:50:57,224 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:50:57,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:50:57,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:50:57,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:50:57,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:50:57,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:50:57,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:50:57,254 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:50:57,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:50:57,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:50:57,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:50:57,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:50:57,255 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:50:57,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:50:57,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:50:57,255 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:50:57,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:50:57,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:50:57,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:50:57,255 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:50:57,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:50:57,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:50:57,256 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:50:57,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:50:57,256 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:50:57,256 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:50:57,256 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:50:57,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:50:57,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:50:57,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:50:57,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:50:57,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:50:57,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:50:57,256 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:50:57,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:50:57,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:50:57,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:50:57,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:50:57,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:50:57,256 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:50:57,256 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:50:57,256 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 -> e1208277e71e1c3dcb7bf16b04051e4f527abbe326e9bfc724844bd2d70dc86a [2025-02-06 03:50:57,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:50:57,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:50:57,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:50:57,494 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:50:57,495 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:50:57,495 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-s_file-37.i [2025-02-06 03:50:58,746 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c390bddc/ee6f6bd033374ed889b1e5d09283fe85/FLAG884a2d63d [2025-02-06 03:50:59,017 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:50:59,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-37.i [2025-02-06 03:50:59,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c390bddc/ee6f6bd033374ed889b1e5d09283fe85/FLAG884a2d63d [2025-02-06 03:50:59,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c390bddc/ee6f6bd033374ed889b1e5d09283fe85 [2025-02-06 03:50:59,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:50:59,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:50:59,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:50:59,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:50:59,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:50:59,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:50:59" (1/1) ... [2025-02-06 03:50:59,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f713cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:59, skipping insertion in model container [2025-02-06 03:50:59,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:50:59" (1/1) ... [2025-02-06 03:50:59,082 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:50:59,178 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-s_file-37.i[916,929] [2025-02-06 03:50:59,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:50:59,244 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:50:59,253 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-s_file-37.i[916,929] [2025-02-06 03:50:59,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:50:59,312 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:50:59,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:59 WrapperNode [2025-02-06 03:50:59,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:50:59,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:50:59,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:50:59,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:50:59,318 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:50:59" (1/1) ... [2025-02-06 03:50:59,330 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:50:59" (1/1) ... [2025-02-06 03:50:59,351 INFO L138 Inliner]: procedures = 30, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 465 [2025-02-06 03:50:59,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:50:59,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:50:59,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:50:59,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:50:59,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:59" (1/1) ... [2025-02-06 03:50:59,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:59" (1/1) ... [2025-02-06 03:50:59,363 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:59" (1/1) ... [2025-02-06 03:50:59,367 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 03:50:59,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:59" (1/1) ... [2025-02-06 03:50:59,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:59" (1/1) ... [2025-02-06 03:50:59,377 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:59" (1/1) ... [2025-02-06 03:50:59,380 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:59" (1/1) ... [2025-02-06 03:50:59,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:59" (1/1) ... [2025-02-06 03:50:59,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:59" (1/1) ... [2025-02-06 03:50:59,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:50:59,388 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:50:59,388 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:50:59,388 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:50:59,389 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:59" (1/1) ... [2025-02-06 03:50:59,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:50:59,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:50:59,412 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:50:59,417 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:50:59,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:50:59,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 03:50:59,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 03:50:59,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 03:50:59,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 03:50:59,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 03:50:59,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 03:50:59,430 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:50:59,430 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:50:59,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 03:50:59,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:50:59,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:50:59,506 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:50:59,511 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:50:59,934 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~bitwise75#1;havoc property_#t~ite80#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~mem79#1;havoc property_#t~mem78#1;havoc property_#t~mem85#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite92#1;havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~short93#1;havoc property_#t~mem94#1;havoc property_#t~ite116#1;havoc property_#t~mem97#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem103#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite102#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem104#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem105#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem108#1;havoc property_#t~ite113#1;havoc property_#t~mem109#1;havoc property_#t~ite111#1;havoc property_#t~mem110#1;havoc property_#t~mem112#1;havoc property_#t~short117#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~short120#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short123#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short126#1; [2025-02-06 03:50:59,973 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2025-02-06 03:50:59,973 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:50:59,991 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:50:59,991 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:50:59,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:50:59 BoogieIcfgContainer [2025-02-06 03:50:59,991 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:50:59,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:50:59,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:50:59,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:50:59,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:50:59" (1/3) ... [2025-02-06 03:50:59,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475b21bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:50:59, skipping insertion in model container [2025-02-06 03:50:59,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:59" (2/3) ... [2025-02-06 03:50:59,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475b21bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:50:59, skipping insertion in model container [2025-02-06 03:50:59,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:50:59" (3/3) ... [2025-02-06 03:51:00,000 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-37.i [2025-02-06 03:51:00,011 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:51:00,012 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-37.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:51:00,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:51:00,055 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;@6e871852, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:51:00,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:51:00,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 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:51:00,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 03:51:00,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:00,066 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] [2025-02-06 03:51:00,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:00,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:00,070 INFO L85 PathProgramCache]: Analyzing trace with hash 772012318, now seen corresponding path program 1 times [2025-02-06 03:51:00,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:00,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695178003] [2025-02-06 03:51:00,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:00,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:00,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:51:00,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:51:00,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:00,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:00,376 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:51:00,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:00,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695178003] [2025-02-06 03:51:00,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695178003] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:51:00,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412330264] [2025-02-06 03:51:00,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:00,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:51:00,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:51:00,379 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:51:00,388 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:51:00,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:51:00,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:51:00,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:00,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:00,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:51:00,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:51:00,573 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:51:00,573 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:51:00,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412330264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:00,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:51:00,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:51:00,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663442766] [2025-02-06 03:51:00,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:00,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:51:00,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:00,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:51:00,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:51:00,590 INFO L87 Difference]: Start difference. First operand has 104 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 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 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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:51:00,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:00,610 INFO L93 Difference]: Finished difference Result 202 states and 314 transitions. [2025-02-06 03:51:00,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:51:00,611 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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 124 [2025-02-06 03:51:00,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:00,615 INFO L225 Difference]: With dead ends: 202 [2025-02-06 03:51:00,615 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 03:51:00,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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:51:00,619 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:00,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:51:00,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 03:51:00,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-06 03:51:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 84 states have internal predecessors, (117), 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:51:00,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2025-02-06 03:51:00,644 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 124 [2025-02-06 03:51:00,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:00,644 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2025-02-06 03:51:00,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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:51:00,645 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2025-02-06 03:51:00,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 03:51:00,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:00,649 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] [2025-02-06 03:51:00,658 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:51:00,854 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:51:00,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:00,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:00,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1635328569, now seen corresponding path program 1 times [2025-02-06 03:51:00,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:00,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235247854] [2025-02-06 03:51:00,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:00,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:00,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:51:00,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:51:00,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:00,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:01,204 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:51:01,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:01,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235247854] [2025-02-06 03:51:01,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235247854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:01,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:01,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:51:01,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086128798] [2025-02-06 03:51:01,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:01,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:51:01,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:01,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:51:01,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:51:01,208 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:51:01,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:01,240 INFO L93 Difference]: Finished difference Result 202 states and 295 transitions. [2025-02-06 03:51:01,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:51:01,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 124 [2025-02-06 03:51:01,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:01,242 INFO L225 Difference]: With dead ends: 202 [2025-02-06 03:51:01,242 INFO L226 Difference]: Without dead ends: 104 [2025-02-06 03:51:01,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:51:01,243 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:01,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 415 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:51:01,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-06 03:51:01,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-02-06 03:51:01,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 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:51:01,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2025-02-06 03:51:01,258 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 124 [2025-02-06 03:51:01,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:01,262 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2025-02-06 03:51:01,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:51:01,263 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2025-02-06 03:51:01,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 03:51:01,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:01,264 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] [2025-02-06 03:51:01,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:51:01,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:01,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:01,264 INFO L85 PathProgramCache]: Analyzing trace with hash 852184264, now seen corresponding path program 1 times [2025-02-06 03:51:01,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:01,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703699122] [2025-02-06 03:51:01,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:01,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:01,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:51:01,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:51:01,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:01,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:01,478 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:51:01,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:01,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703699122] [2025-02-06 03:51:01,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703699122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:01,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:01,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:51:01,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136725939] [2025-02-06 03:51:01,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:01,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:51:01,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:01,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:51:01,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:51:01,480 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:51:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:01,506 INFO L93 Difference]: Finished difference Result 206 states and 299 transitions. [2025-02-06 03:51:01,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:51:01,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 124 [2025-02-06 03:51:01,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:01,507 INFO L225 Difference]: With dead ends: 206 [2025-02-06 03:51:01,507 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 03:51:01,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:51:01,508 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:01,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 416 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:51:01,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 03:51:01,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-02-06 03:51:01,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.375) internal successors, (121), 88 states have internal predecessors, (121), 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:51:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2025-02-06 03:51:01,514 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 124 [2025-02-06 03:51:01,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:01,514 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2025-02-06 03:51:01,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:51:01,515 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2025-02-06 03:51:01,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 03:51:01,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:01,517 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] [2025-02-06 03:51:01,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:51:01,518 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:01,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:01,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1739687945, now seen corresponding path program 1 times [2025-02-06 03:51:01,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:01,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223291006] [2025-02-06 03:51:01,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:01,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:01,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:51:01,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:51:01,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:01,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:01,654 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:51:01,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:01,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223291006] [2025-02-06 03:51:01,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223291006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:01,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:01,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:51:01,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922228759] [2025-02-06 03:51:01,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:01,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:51:01,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:01,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:51:01,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:51:01,656 INFO L87 Difference]: Start difference. First operand 105 states and 151 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:51:01,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:01,678 INFO L93 Difference]: Finished difference Result 210 states and 303 transitions. [2025-02-06 03:51:01,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:51:01,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 124 [2025-02-06 03:51:01,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:01,680 INFO L225 Difference]: With dead ends: 210 [2025-02-06 03:51:01,680 INFO L226 Difference]: Without dead ends: 108 [2025-02-06 03:51:01,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:51:01,681 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:01,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 418 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:51:01,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-06 03:51:01,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-02-06 03:51:01,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 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:51:01,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2025-02-06 03:51:01,693 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 124 [2025-02-06 03:51:01,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:01,694 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2025-02-06 03:51:01,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:51:01,694 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2025-02-06 03:51:01,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 03:51:01,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:01,695 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] [2025-02-06 03:51:01,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:51:01,696 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:01,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:01,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1740611466, now seen corresponding path program 1 times [2025-02-06 03:51:01,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:01,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630819716] [2025-02-06 03:51:01,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:01,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:01,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:51:01,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:51:01,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:01,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:03,062 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:51:03,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:03,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630819716] [2025-02-06 03:51:03,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630819716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:03,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:03,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:51:03,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939496609] [2025-02-06 03:51:03,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:03,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:51:03,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:03,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:51:03,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:51:03,066 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (15), 1 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:51:03,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:03,369 INFO L93 Difference]: Finished difference Result 225 states and 320 transitions. [2025-02-06 03:51:03,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:51:03,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (15), 1 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 124 [2025-02-06 03:51:03,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:03,371 INFO L225 Difference]: With dead ends: 225 [2025-02-06 03:51:03,371 INFO L226 Difference]: Without dead ends: 121 [2025-02-06 03:51:03,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:51:03,372 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 78 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:03,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 479 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:51:03,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-06 03:51:03,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2025-02-06 03:51:03,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.3265306122448979) internal successors, (130), 99 states have internal predecessors, (130), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:51:03,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2025-02-06 03:51:03,382 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 124 [2025-02-06 03:51:03,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:03,382 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2025-02-06 03:51:03,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (15), 1 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:51:03,383 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2025-02-06 03:51:03,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 03:51:03,383 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:03,384 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:51:03,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:51:03,384 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:03,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:03,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1913723188, now seen corresponding path program 1 times [2025-02-06 03:51:03,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:03,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017234798] [2025-02-06 03:51:03,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:03,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:03,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:51:03,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:51:03,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:03,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:04,455 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:51:04,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:04,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017234798] [2025-02-06 03:51:04,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017234798] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:51:04,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465138185] [2025-02-06 03:51:04,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:04,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:51:04,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:51:04,458 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:51:04,459 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:51:04,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:51:04,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:51:04,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:04,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:04,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 03:51:04,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:51:04,724 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 29 treesize of output 13 [2025-02-06 03:51:04,745 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 29 treesize of output 13 [2025-02-06 03:51:04,766 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 29 treesize of output 13 [2025-02-06 03:51:04,783 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 29 treesize of output 13 [2025-02-06 03:51:04,813 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 19 treesize of output 7 [2025-02-06 03:51:04,828 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 218 proven. 24 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-02-06 03:51:04,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:51:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:51:05,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465138185] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:51:05,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:51:05,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2025-02-06 03:51:05,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307541140] [2025-02-06 03:51:05,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:51:05,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 03:51:05,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:05,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 03:51:05,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:51:05,126 INFO L87 Difference]: Start difference. First operand 120 states and 168 transitions. Second operand has 16 states, 13 states have (on average 6.769230769230769) internal successors, (88), 16 states have internal predecessors, (88), 7 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 4 states have call predecessors, (39), 7 states have call successors, (39) [2025-02-06 03:51:06,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:06,173 INFO L93 Difference]: Finished difference Result 244 states and 333 transitions. [2025-02-06 03:51:06,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 03:51:06,174 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 6.769230769230769) internal successors, (88), 16 states have internal predecessors, (88), 7 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 4 states have call predecessors, (39), 7 states have call successors, (39) Word has length 127 [2025-02-06 03:51:06,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:06,177 INFO L225 Difference]: With dead ends: 244 [2025-02-06 03:51:06,178 INFO L226 Difference]: Without dead ends: 136 [2025-02-06 03:51:06,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 251 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2025-02-06 03:51:06,180 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 544 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:06,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 511 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:51:06,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-06 03:51:06,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2025-02-06 03:51:06,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 108 states have internal predecessors, (138), 19 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:51:06,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 176 transitions. [2025-02-06 03:51:06,196 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 176 transitions. Word has length 127 [2025-02-06 03:51:06,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:06,196 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 176 transitions. [2025-02-06 03:51:06,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 6.769230769230769) internal successors, (88), 16 states have internal predecessors, (88), 7 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 4 states have call predecessors, (39), 7 states have call successors, (39) [2025-02-06 03:51:06,196 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 176 transitions. [2025-02-06 03:51:06,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 03:51:06,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:06,200 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:51:06,213 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:51:06,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:51:06,401 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:06,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:06,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1658986643, now seen corresponding path program 1 times [2025-02-06 03:51:06,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:06,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447096721] [2025-02-06 03:51:06,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:06,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:06,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:51:06,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:51:06,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:06,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:06,998 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:51:06,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:06,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447096721] [2025-02-06 03:51:06,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447096721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:06,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:06,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:51:06,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264184095] [2025-02-06 03:51:06,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:06,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:51:06,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:07,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:51:07,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:51:07,001 INFO L87 Difference]: Start difference. First operand 132 states and 176 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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:51:07,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:07,329 INFO L93 Difference]: Finished difference Result 285 states and 382 transitions. [2025-02-06 03:51:07,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:51:07,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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:51:07,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:07,330 INFO L225 Difference]: With dead ends: 285 [2025-02-06 03:51:07,330 INFO L226 Difference]: Without dead ends: 169 [2025-02-06 03:51:07,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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:51:07,331 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 117 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:07,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 413 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:51:07,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-06 03:51:07,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2025-02-06 03:51:07,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 129 states have (on average 1.255813953488372) internal successors, (162), 130 states have internal predecessors, (162), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:51:07,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 222 transitions. [2025-02-06 03:51:07,352 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 222 transitions. Word has length 127 [2025-02-06 03:51:07,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:07,352 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 222 transitions. [2025-02-06 03:51:07,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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:51:07,353 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 222 transitions. [2025-02-06 03:51:07,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 03:51:07,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:07,354 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:51:07,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:51:07,354 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:07,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:07,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1128428844, now seen corresponding path program 1 times [2025-02-06 03:51:07,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:07,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483926111] [2025-02-06 03:51:07,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:07,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:07,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:51:07,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:51:07,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:07,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:08,209 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:51:08,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:08,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483926111] [2025-02-06 03:51:08,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483926111] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:51:08,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785316453] [2025-02-06 03:51:08,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:08,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:51:08,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:51:08,212 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:51:08,221 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:51:08,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:51:08,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:51:08,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:08,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:08,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-06 03:51:08,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:51:08,459 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-02-06 03:51:08,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 03:51:08,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 03:51:08,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 03:51:08,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:08,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-02-06 03:51:08,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:08,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-02-06 03:51:08,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:08,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-02-06 03:51:09,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:09,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-02-06 03:51:09,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:09,124 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 39 treesize of output 30 [2025-02-06 03:51:09,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:09,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 38 [2025-02-06 03:51:09,241 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 194 proven. 42 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-02-06 03:51:09,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:51:09,627 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:51:09,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785316453] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:51:09,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:51:09,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2025-02-06 03:51:09,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611616592] [2025-02-06 03:51:09,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:51:09,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 03:51:09,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:09,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 03:51:09,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2025-02-06 03:51:09,629 INFO L87 Difference]: Start difference. First operand 167 states and 222 transitions. Second operand has 28 states, 24 states have (on average 5.0) internal successors, (120), 28 states have internal predecessors, (120), 10 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 6 states have call predecessors, (45), 10 states have call successors, (45) [2025-02-06 03:51:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:10,689 INFO L93 Difference]: Finished difference Result 301 states and 394 transitions. [2025-02-06 03:51:10,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 03:51:10,690 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 5.0) internal successors, (120), 28 states have internal predecessors, (120), 10 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 6 states have call predecessors, (45), 10 states have call successors, (45) Word has length 127 [2025-02-06 03:51:10,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:10,691 INFO L225 Difference]: With dead ends: 301 [2025-02-06 03:51:10,691 INFO L226 Difference]: Without dead ends: 185 [2025-02-06 03:51:10,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=279, Invalid=1127, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 03:51:10,692 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 176 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:10,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 597 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 03:51:10,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-06 03:51:10,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 144. [2025-02-06 03:51:10,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 115 states have (on average 1.2521739130434784) internal successors, (144), 116 states have internal predecessors, (144), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 03:51:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 186 transitions. [2025-02-06 03:51:10,702 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 186 transitions. Word has length 127 [2025-02-06 03:51:10,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:10,702 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 186 transitions. [2025-02-06 03:51:10,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 5.0) internal successors, (120), 28 states have internal predecessors, (120), 10 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 6 states have call predecessors, (45), 10 states have call successors, (45) [2025-02-06 03:51:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2025-02-06 03:51:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 03:51:10,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:10,703 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:51:10,713 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:51:10,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:51:10,908 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:10,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:10,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1097409037, now seen corresponding path program 1 times [2025-02-06 03:51:10,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:10,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148967509] [2025-02-06 03:51:10,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:10,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:10,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:51:10,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:51:10,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:10,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:11,861 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:51:11,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:11,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148967509] [2025-02-06 03:51:11,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148967509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:11,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:11,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:51:11,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786874107] [2025-02-06 03:51:11,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:11,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:51:11,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:11,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:51:11,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:51:11,863 INFO L87 Difference]: Start difference. First operand 144 states and 186 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (15), 1 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:51:12,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:12,410 INFO L93 Difference]: Finished difference Result 264 states and 344 transitions. [2025-02-06 03:51:12,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:51:12,410 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (15), 1 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 127 [2025-02-06 03:51:12,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:12,412 INFO L225 Difference]: With dead ends: 264 [2025-02-06 03:51:12,412 INFO L226 Difference]: Without dead ends: 144 [2025-02-06 03:51:12,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:51:12,413 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 72 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:12,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 625 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:51:12,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-06 03:51:12,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-02-06 03:51:12,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 115 states have (on average 1.2434782608695651) internal successors, (143), 116 states have internal predecessors, (143), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 03:51:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 185 transitions. [2025-02-06 03:51:12,428 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 185 transitions. Word has length 127 [2025-02-06 03:51:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:12,428 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 185 transitions. [2025-02-06 03:51:12,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (15), 1 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:51:12,429 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 185 transitions. [2025-02-06 03:51:12,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 03:51:12,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:12,431 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:51:12,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:51:12,431 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:12,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:12,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1602967662, now seen corresponding path program 1 times [2025-02-06 03:51:12,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:12,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264375698] [2025-02-06 03:51:12,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:12,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:12,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:51:12,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:51:12,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:12,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:12,725 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:51:12,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:12,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264375698] [2025-02-06 03:51:12,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264375698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:12,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:12,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:51:12,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390989999] [2025-02-06 03:51:12,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:12,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:51:12,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:12,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:51:12,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:51:12,727 INFO L87 Difference]: Start difference. First operand 144 states and 185 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:51:12,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:12,949 INFO L93 Difference]: Finished difference Result 279 states and 359 transitions. [2025-02-06 03:51:12,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:51:12,950 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:51:12,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:12,951 INFO L225 Difference]: With dead ends: 279 [2025-02-06 03:51:12,952 INFO L226 Difference]: Without dead ends: 159 [2025-02-06 03:51:12,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 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:51:12,952 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 92 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:12,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 533 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:51:12,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-06 03:51:12,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2025-02-06 03:51:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 123 states have (on average 1.2195121951219512) internal successors, (150), 124 states have internal predecessors, (150), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:51:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 200 transitions. [2025-02-06 03:51:12,965 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 200 transitions. Word has length 127 [2025-02-06 03:51:12,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:12,966 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 200 transitions. [2025-02-06 03:51:12,966 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:51:12,966 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 200 transitions. [2025-02-06 03:51:12,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:51:12,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:12,967 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, 1] [2025-02-06 03:51:12,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:51:12,967 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:12,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:12,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1287724333, now seen corresponding path program 1 times [2025-02-06 03:51:12,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:12,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656722051] [2025-02-06 03:51:12,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:12,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:12,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:51:13,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:51:13,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:13,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:51:14,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:14,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656722051] [2025-02-06 03:51:14,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656722051] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:51:14,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49174701] [2025-02-06 03:51:14,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:14,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:51:14,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:51:14,187 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:51:14,188 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:51:14,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:51:14,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:51:14,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:14,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:14,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-06 03:51:14,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:51:14,390 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:51:14,394 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:51:14,398 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:51:14,401 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:51:14,405 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:51:14,415 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 92 treesize of output 56 [2025-02-06 03:51:14,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:14,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 96 treesize of output 56 [2025-02-06 03:51:14,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:14,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 96 treesize of output 65 [2025-02-06 03:51:14,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:14,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 109 treesize of output 84 [2025-02-06 03:51:14,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:14,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 124 treesize of output 87 [2025-02-06 03:51:15,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:15,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 234 treesize of output 92 [2025-02-06 03:51:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:51:15,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:51:15,564 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:51:15,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49174701] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:51:15,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:51:15,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18, 12] total 29 [2025-02-06 03:51:15,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115988462] [2025-02-06 03:51:15,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:15,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:51:15,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:15,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:51:15,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2025-02-06 03:51:15,566 INFO L87 Difference]: Start difference. First operand 158 states and 200 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 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:51:16,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:16,157 INFO L93 Difference]: Finished difference Result 184 states and 233 transitions. [2025-02-06 03:51:16,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:51:16,158 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 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 129 [2025-02-06 03:51:16,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:16,159 INFO L225 Difference]: With dead ends: 184 [2025-02-06 03:51:16,159 INFO L226 Difference]: Without dead ends: 182 [2025-02-06 03:51:16,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 255 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2025-02-06 03:51:16,160 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 415 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:16,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 492 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:51:16,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-02-06 03:51:16,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2025-02-06 03:51:16,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 139 states have (on average 1.2158273381294964) internal successors, (169), 140 states have internal predecessors, (169), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:51:16,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 229 transitions. [2025-02-06 03:51:16,181 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 229 transitions. Word has length 129 [2025-02-06 03:51:16,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:16,182 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 229 transitions. [2025-02-06 03:51:16,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 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:51:16,182 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 229 transitions. [2025-02-06 03:51:16,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:51:16,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:16,183 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, 1] [2025-02-06 03:51:16,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 03:51:16,387 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,SelfDestructingSolverStorable10 [2025-02-06 03:51:16,387 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:16,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:16,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1288647854, now seen corresponding path program 1 times [2025-02-06 03:51:16,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:16,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957663192] [2025-02-06 03:51:16,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:16,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:16,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:51:16,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:51:16,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:16,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:16,656 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:51:16,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:16,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957663192] [2025-02-06 03:51:16,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957663192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:16,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:16,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:51:16,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543330217] [2025-02-06 03:51:16,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:16,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:51:16,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:16,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:51:16,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:51:16,659 INFO L87 Difference]: Start difference. First operand 180 states and 229 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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:51:16,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:16,846 INFO L93 Difference]: Finished difference Result 307 states and 391 transitions. [2025-02-06 03:51:16,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:51:16,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 129 [2025-02-06 03:51:16,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:16,849 INFO L225 Difference]: With dead ends: 307 [2025-02-06 03:51:16,849 INFO L226 Difference]: Without dead ends: 182 [2025-02-06 03:51:16,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-02-06 03:51:16,849 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 105 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:16,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 464 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:51:16,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-02-06 03:51:16,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2025-02-06 03:51:16,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 139 states have (on average 1.20863309352518) internal successors, (168), 140 states have internal predecessors, (168), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:51:16,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 228 transitions. [2025-02-06 03:51:16,863 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 228 transitions. Word has length 129 [2025-02-06 03:51:16,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:16,864 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 228 transitions. [2025-02-06 03:51:16,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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:51:16,864 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 228 transitions. [2025-02-06 03:51:16,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:51:16,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:16,865 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, 1] [2025-02-06 03:51:16,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:51:16,865 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:16,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:16,865 INFO L85 PathProgramCache]: Analyzing trace with hash -2118815761, now seen corresponding path program 1 times [2025-02-06 03:51:16,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:16,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954846614] [2025-02-06 03:51:16,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:16,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:16,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:51:16,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:51:16,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:16,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:17,170 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:51:17,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:17,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954846614] [2025-02-06 03:51:17,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954846614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:17,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:17,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:51:17,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79022760] [2025-02-06 03:51:17,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:17,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:51:17,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:17,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:51:17,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:51:17,172 INFO L87 Difference]: Start difference. First operand 180 states and 228 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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:51:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:17,336 INFO L93 Difference]: Finished difference Result 305 states and 387 transitions. [2025-02-06 03:51:17,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:51:17,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 129 [2025-02-06 03:51:17,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:17,338 INFO L225 Difference]: With dead ends: 305 [2025-02-06 03:51:17,339 INFO L226 Difference]: Without dead ends: 180 [2025-02-06 03:51:17,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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-02-06 03:51:17,340 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 76 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:17,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 379 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:51:17,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-06 03:51:17,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-02-06 03:51:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 139 states have (on average 1.2014388489208634) internal successors, (167), 140 states have internal predecessors, (167), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:51:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 227 transitions. [2025-02-06 03:51:17,356 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 227 transitions. Word has length 129 [2025-02-06 03:51:17,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:17,356 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 227 transitions. [2025-02-06 03:51:17,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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:51:17,356 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 227 transitions. [2025-02-06 03:51:17,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:51:17,357 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:17,357 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, 1] [2025-02-06 03:51:17,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:51:17,357 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:17,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:17,358 INFO L85 PathProgramCache]: Analyzing trace with hash 368697072, now seen corresponding path program 1 times [2025-02-06 03:51:17,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:17,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378734468] [2025-02-06 03:51:17,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:17,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:17,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:51:17,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:51:17,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:17,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:18,677 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:51:18,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:18,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378734468] [2025-02-06 03:51:18,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378734468] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:51:18,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029167749] [2025-02-06 03:51:18,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:18,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:51:18,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:51:18,680 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:51:18,681 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:51:18,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:51:18,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:51:18,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:18,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:18,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 03:51:19,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:51:19,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:19,014 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 113 treesize of output 64 [2025-02-06 03:51:19,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:19,159 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 347 treesize of output 143 [2025-02-06 03:51:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:51:19,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:51:19,357 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:51:19,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029167749] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:51:19,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:51:19,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17, 8] total 20 [2025-02-06 03:51:19,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487592645] [2025-02-06 03:51:19,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:19,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:51:19,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:19,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:51:19,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:51:19,359 INFO L87 Difference]: Start difference. First operand 180 states and 227 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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:51:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:19,622 INFO L93 Difference]: Finished difference Result 378 states and 473 transitions. [2025-02-06 03:51:19,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:51:19,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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 129 [2025-02-06 03:51:19,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:19,624 INFO L225 Difference]: With dead ends: 378 [2025-02-06 03:51:19,625 INFO L226 Difference]: Without dead ends: 253 [2025-02-06 03:51:19,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 263 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:51:19,626 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 62 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:19,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 617 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:51:19,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-02-06 03:51:19,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 197. [2025-02-06 03:51:19,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 156 states have (on average 1.2115384615384615) internal successors, (189), 157 states have internal predecessors, (189), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:51:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 249 transitions. [2025-02-06 03:51:19,641 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 249 transitions. Word has length 129 [2025-02-06 03:51:19,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:19,642 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 249 transitions. [2025-02-06 03:51:19,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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:51:19,642 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 249 transitions. [2025-02-06 03:51:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:51:19,643 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:19,643 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, 1, 1, 1] [2025-02-06 03:51:19,651 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:51:19,843 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,SelfDestructingSolverStorable13 [2025-02-06 03:51:19,844 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:19,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:19,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1382310781, now seen corresponding path program 1 times [2025-02-06 03:51:19,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:19,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305297220] [2025-02-06 03:51:19,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:19,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:19,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:51:19,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:51:19,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:19,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:20,451 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:51:20,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:20,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305297220] [2025-02-06 03:51:20,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305297220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:20,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:20,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:51:20,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038152497] [2025-02-06 03:51:20,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:20,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:51:20,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:20,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:51:20,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:51:20,453 INFO L87 Difference]: Start difference. First operand 197 states and 249 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (15), 1 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:51:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:20,618 INFO L93 Difference]: Finished difference Result 339 states and 429 transitions. [2025-02-06 03:51:20,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:51:20,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (15), 1 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 131 [2025-02-06 03:51:20,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:20,619 INFO L225 Difference]: With dead ends: 339 [2025-02-06 03:51:20,619 INFO L226 Difference]: Without dead ends: 197 [2025-02-06 03:51:20,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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:51:20,624 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 89 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:20,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 273 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:51:20,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-06 03:51:20,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-02-06 03:51:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 156 states have (on average 1.205128205128205) internal successors, (188), 157 states have internal predecessors, (188), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:51:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 248 transitions. [2025-02-06 03:51:20,648 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 248 transitions. Word has length 131 [2025-02-06 03:51:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:20,649 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 248 transitions. [2025-02-06 03:51:20,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (15), 1 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:51:20,650 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 248 transitions. [2025-02-06 03:51:20,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:51:20,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:20,650 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, 1, 1, 1] [2025-02-06 03:51:20,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:51:20,651 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:20,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1315304028, now seen corresponding path program 1 times [2025-02-06 03:51:20,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:20,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996633434] [2025-02-06 03:51:20,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:20,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:20,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:51:20,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:51:20,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:20,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:21,625 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 57 proven. 21 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-02-06 03:51:21,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:21,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996633434] [2025-02-06 03:51:21,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996633434] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:51:21,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045129185] [2025-02-06 03:51:21,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:21,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:51:21,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:51:21,628 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:51:21,630 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:51:21,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:51:21,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:51:21,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:21,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:21,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 03:51:21,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:51:21,859 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:51:21,882 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 29 treesize of output 13 [2025-02-06 03:51:21,901 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 29 treesize of output 13 [2025-02-06 03:51:21,928 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 29 treesize of output 13 [2025-02-06 03:51:21,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 03:51:22,044 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 0 case distinctions, treesize of input 51 treesize of output 36 [2025-02-06 03:51:22,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:22,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 64 treesize of output 42 [2025-02-06 03:51:22,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:22,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 64 treesize of output 42 [2025-02-06 03:51:22,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:22,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 62 treesize of output 58 [2025-02-06 03:51:22,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:22,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 76 treesize of output 24 [2025-02-06 03:51:22,298 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 266 proven. 3 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-02-06 03:51:22,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:51:22,942 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:51:22,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045129185] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:51:22,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:51:22,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 33 [2025-02-06 03:51:22,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148354743] [2025-02-06 03:51:22,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:51:22,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-06 03:51:22,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:22,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-06 03:51:22,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 03:51:22,945 INFO L87 Difference]: Start difference. First operand 197 states and 248 transitions. Second operand has 33 states, 28 states have (on average 4.714285714285714) internal successors, (132), 33 states have internal predecessors, (132), 13 states have call successors, (39), 3 states have call predecessors, (39), 6 states have return successors, (39), 8 states have call predecessors, (39), 13 states have call successors, (39) [2025-02-06 03:51:25,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:25,090 INFO L93 Difference]: Finished difference Result 369 states and 451 transitions. [2025-02-06 03:51:25,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-06 03:51:25,090 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 4.714285714285714) internal successors, (132), 33 states have internal predecessors, (132), 13 states have call successors, (39), 3 states have call predecessors, (39), 6 states have return successors, (39), 8 states have call predecessors, (39), 13 states have call successors, (39) Word has length 131 [2025-02-06 03:51:25,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:25,091 INFO L225 Difference]: With dead ends: 369 [2025-02-06 03:51:25,091 INFO L226 Difference]: Without dead ends: 227 [2025-02-06 03:51:25,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 253 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=913, Invalid=3509, Unknown=0, NotChecked=0, Total=4422 [2025-02-06 03:51:25,093 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 779 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:25,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 622 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 03:51:25,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-02-06 03:51:25,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 209. [2025-02-06 03:51:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 166 states have (on average 1.1867469879518073) internal successors, (197), 167 states have internal predecessors, (197), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:51:25,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 253 transitions. [2025-02-06 03:51:25,118 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 253 transitions. Word has length 131 [2025-02-06 03:51:25,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:25,118 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 253 transitions. [2025-02-06 03:51:25,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 4.714285714285714) internal successors, (132), 33 states have internal predecessors, (132), 13 states have call successors, (39), 3 states have call predecessors, (39), 6 states have return successors, (39), 8 states have call predecessors, (39), 13 states have call successors, (39) [2025-02-06 03:51:25,119 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 253 transitions. [2025-02-06 03:51:25,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 03:51:25,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:25,119 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, 1, 1, 1, 1, 1] [2025-02-06 03:51:25,141 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:51:25,339 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,SelfDestructingSolverStorable15 [2025-02-06 03:51:25,341 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:25,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:25,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1203712340, now seen corresponding path program 1 times [2025-02-06 03:51:25,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:25,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903322403] [2025-02-06 03:51:25,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:25,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:25,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 03:51:25,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 03:51:25,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:25,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:25,555 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:51:25,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:25,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903322403] [2025-02-06 03:51:25,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903322403] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:51:25,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630651549] [2025-02-06 03:51:25,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:25,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:51:25,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:51:25,558 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:51:25,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 03:51:25,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 03:51:25,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 03:51:25,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:25,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:25,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:51:25,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:51:25,799 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:51:25,799 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:51:25,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630651549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:25,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:51:25,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-02-06 03:51:25,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362704890] [2025-02-06 03:51:25,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:25,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:51:25,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:25,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:51:25,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:51:25,800 INFO L87 Difference]: Start difference. First operand 209 states and 253 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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:51:25,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:25,844 INFO L93 Difference]: Finished difference Result 367 states and 445 transitions. [2025-02-06 03:51:25,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:51:25,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 133 [2025-02-06 03:51:25,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:25,846 INFO L225 Difference]: With dead ends: 367 [2025-02-06 03:51:25,846 INFO L226 Difference]: Without dead ends: 213 [2025-02-06 03:51:25,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:51:25,847 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:25,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 656 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:51:25,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-02-06 03:51:25,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2025-02-06 03:51:25,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 167 states have (on average 1.18562874251497) internal successors, (198), 168 states have internal predecessors, (198), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:51:25,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 254 transitions. [2025-02-06 03:51:25,866 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 254 transitions. Word has length 133 [2025-02-06 03:51:25,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:25,866 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 254 transitions. [2025-02-06 03:51:25,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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:51:25,866 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 254 transitions. [2025-02-06 03:51:25,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:51:25,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:25,867 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:51:25,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 03:51:26,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:51:26,068 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:26,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:26,068 INFO L85 PathProgramCache]: Analyzing trace with hash -707236203, now seen corresponding path program 1 times [2025-02-06 03:51:26,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:26,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183083047] [2025-02-06 03:51:26,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:26,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:26,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:51:26,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:51:26,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:26,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:51:26,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [324031376] [2025-02-06 03:51:26,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:26,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:51:26,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:51:26,189 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:51:26,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 03:51:26,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:51:26,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:51:26,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:26,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:26,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 03:51:26,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:51:26,634 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:51:26,636 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:51:26,639 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:51:26,641 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:51:26,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2025-02-06 03:51:26,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:26,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 105 treesize of output 59 [2025-02-06 03:51:26,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 68 [2025-02-06 03:51:26,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:26,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 137 treesize of output 94 [2025-02-06 03:51:26,899 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:51:26,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:51:26,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:26,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183083047] [2025-02-06 03:51:26,900 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:51:26,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324031376] [2025-02-06 03:51:26,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324031376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:26,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:26,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:51:26,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267187274] [2025-02-06 03:51:26,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:26,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:51:26,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:26,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:51:26,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:51:26,901 INFO L87 Difference]: Start difference. First operand 210 states and 254 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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:51:27,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:27,372 INFO L93 Difference]: Finished difference Result 366 states and 444 transitions. [2025-02-06 03:51:27,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:51:27,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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 135 [2025-02-06 03:51:27,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:27,377 INFO L225 Difference]: With dead ends: 366 [2025-02-06 03:51:27,377 INFO L226 Difference]: Without dead ends: 211 [2025-02-06 03:51:27,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 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:51:27,378 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 87 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:27,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 385 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:51:27,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-02-06 03:51:27,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-02-06 03:51:27,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 168 states have (on average 1.1845238095238095) internal successors, (199), 169 states have internal predecessors, (199), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:51:27,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 255 transitions. [2025-02-06 03:51:27,420 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 255 transitions. Word has length 135 [2025-02-06 03:51:27,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:27,421 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 255 transitions. [2025-02-06 03:51:27,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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:51:27,421 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 255 transitions. [2025-02-06 03:51:27,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:51:27,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:27,422 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:51:27,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 03:51:27,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 03:51:27,622 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:27,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:27,623 INFO L85 PathProgramCache]: Analyzing trace with hash -356436266, now seen corresponding path program 1 times [2025-02-06 03:51:27,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:27,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587463903] [2025-02-06 03:51:27,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:27,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:27,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:51:27,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:51:27,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:27,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:51:27,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1270800842] [2025-02-06 03:51:27,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:27,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:51:27,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:51:27,714 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:51:27,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 03:51:27,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:51:28,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:51:28,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:28,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:28,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 03:51:28,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:51:28,093 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:51:28,095 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:51:28,096 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:51:28,098 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:51:28,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2025-02-06 03:51:28,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:28,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 105 treesize of output 59 [2025-02-06 03:51:28,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:28,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 105 treesize of output 68 [2025-02-06 03:51:28,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:28,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 116 treesize of output 71 [2025-02-06 03:51:28,426 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 115 treesize of output 87 [2025-02-06 03:51:28,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:28,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 127 [2025-02-06 03:51:28,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 59 [2025-02-06 03:51:28,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:28,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 188 treesize of output 56 [2025-02-06 03:51:28,585 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:51:28,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:51:28,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:28,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587463903] [2025-02-06 03:51:28,585 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:51:28,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270800842] [2025-02-06 03:51:28,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270800842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:28,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:28,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:51:28,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478528606] [2025-02-06 03:51:28,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:28,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:51:28,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:28,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:51:28,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:51:28,587 INFO L87 Difference]: Start difference. First operand 211 states and 255 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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:51:29,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:29,392 INFO L93 Difference]: Finished difference Result 449 states and 545 transitions. [2025-02-06 03:51:29,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:51:29,393 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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 135 [2025-02-06 03:51:29,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:29,395 INFO L225 Difference]: With dead ends: 449 [2025-02-06 03:51:29,395 INFO L226 Difference]: Without dead ends: 293 [2025-02-06 03:51:29,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:51:29,396 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 226 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:29,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 719 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:51:29,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-02-06 03:51:29,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 220. [2025-02-06 03:51:29,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 177 states have (on average 1.192090395480226) internal successors, (211), 178 states have internal predecessors, (211), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:51:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 267 transitions. [2025-02-06 03:51:29,420 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 267 transitions. Word has length 135 [2025-02-06 03:51:29,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:29,420 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 267 transitions. [2025-02-06 03:51:29,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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:51:29,421 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 267 transitions. [2025-02-06 03:51:29,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:51:29,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:29,422 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:51:29,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 03:51:29,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:51:29,626 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:29,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:29,627 INFO L85 PathProgramCache]: Analyzing trace with hash -765260491, now seen corresponding path program 1 times [2025-02-06 03:51:29,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:29,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948794111] [2025-02-06 03:51:29,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:29,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:29,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:51:29,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:51:29,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:29,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:51:29,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1780000634] [2025-02-06 03:51:29,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:29,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:51:29,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:51:29,696 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:51:29,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 03:51:29,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:51:30,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:51:30,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:30,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:51:30,459 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:51:30,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:51:30,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:51:30,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:30,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:51:31,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:51:31,047 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:51:31,048 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:51:31,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 03:51:31,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:51:31,252 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:51:31,282 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:51:31,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:51:31 BoogieIcfgContainer [2025-02-06 03:51:31,283 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:51:31,284 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:51:31,284 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:51:31,284 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:51:31,285 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:50:59" (3/4) ... [2025-02-06 03:51:31,286 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:51:31,286 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:51:31,287 INFO L158 Benchmark]: Toolchain (without parser) took 32233.65ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 133.4MB in the beginning and 154.8MB in the end (delta: -21.4MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. [2025-02-06 03:51:31,287 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 218.1MB. Free memory is still 132.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:51:31,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.39ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 117.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:51:31,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.93ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 113.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:51:31,287 INFO L158 Benchmark]: Boogie Preprocessor took 35.03ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 110.1MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:51:31,288 INFO L158 Benchmark]: IcfgBuilder took 603.51ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 75.3MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:51:31,288 INFO L158 Benchmark]: TraceAbstraction took 31289.55ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 74.6MB in the beginning and 157.5MB in the end (delta: -82.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:51:31,288 INFO L158 Benchmark]: Witness Printer took 2.50ms. Allocated memory is still 243.3MB. Free memory was 154.9MB in the beginning and 154.8MB in the end (delta: 48.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:51:31,288 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.24ms. Allocated memory is still 218.1MB. Free memory is still 132.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.39ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 117.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.93ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 113.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.03ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 110.1MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 603.51ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 75.3MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 31289.55ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 74.6MB in the beginning and 157.5MB in the end (delta: -82.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.50ms. Allocated memory is still 243.3MB. Free memory was 154.9MB in the beginning and 154.8MB in the end (delta: 48.1kB). 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 someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 73. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 8, 59049, 100, 16, -25, 16, 25, -10, 0, 25.1, 2531521428, -128, 256, -16 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L113] isInitial = 1 [L114] FCALL initially() [L115] COND TRUE 1 [L116] FCALL updateLastVariables() [L117] CALL updateVariables() [L82] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ushort() [L83] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L84] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1] [L85] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L86] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L87] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] WrapperStruct00.var_1_8 = __VERIFIER_nondet_char() [L92] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] WrapperStruct00.var_1_9 = __VERIFIER_nondet_char() [L95] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 31) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 31) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] WrapperStruct00.var_1_10 = __VERIFIER_nondet_char() [L98] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L101] EXPR WrapperStruct00.var_1_12 [L101] EXPR WrapperStruct00.var_1_12 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_12 [L101] EXPR WrapperStruct00.var_1_12 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_13 = __VERIFIER_nondet_ulong() [L103] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] RET updateVariables() [L118] CALL step() [L58] EXPR WrapperStruct00.var_1_8 [L58] WrapperStruct00.var_1_14 = WrapperStruct00.var_1_8 [L59] EXPR WrapperStruct00.var_1_14 [L59] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_14 [L60] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L60] EXPR ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14) [L60] EXPR WrapperStruct00.var_1_14 [L60] EXPR ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14) VAL [WrapperStruct00={4:0}, isInitial=1] [L60] signed long int stepLocal_0 = (((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)); [L61] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=2] [L61] COND FALSE !(WrapperStruct00.var_1_2 <= stepLocal_0) [L64] EXPR WrapperStruct00.var_1_10 [L64] WrapperStruct00.var_1_7 = WrapperStruct00.var_1_10 [L66] EXPR WrapperStruct00.var_1_16 [L66] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_16 [L67] EXPR WrapperStruct00.var_1_2 [L67] EXPR WrapperStruct00.var_1_3 [L67] EXPR WrapperStruct00.var_1_15 [L67] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L67] EXPR (WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16) VAL [WrapperStruct00={4:0}, isInitial=1] [L67] COND FALSE !(((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) [L70] EXPR WrapperStruct00.var_1_6 [L70] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_6 [L72] EXPR WrapperStruct00.var_1_1 [L72] unsigned char stepLocal_1 = WrapperStruct00.var_1_1; [L73] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=0] [L73] COND FALSE !(2.75f > WrapperStruct00.var_1_12) [L76] EXPR WrapperStruct00.var_1_13 [L76] EXPR WrapperStruct00.var_1_14 [L76] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=0] [L76] EXPR ((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8) [L76] EXPR WrapperStruct00.var_1_8 [L76] EXPR ((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=0] [L76] COND TRUE (WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > stepLocal_1 [L77] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L77] EXPR ((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5)) [L77] EXPR WrapperStruct00.var_1_8 [L77] EXPR ((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5)) VAL [WrapperStruct00={4:0}, isInitial=1] [L77] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L77] EXPR ((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10) [L77] EXPR WrapperStruct00.var_1_10 [L77] EXPR ((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1] [L77] WrapperStruct00.var_1_11 = ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))) [L118] RET step() [L119] CALL, EXPR property() [L109] EXPR WrapperStruct00.var_1_2 [L109] EXPR WrapperStruct00.var_1_3 [L109] EXPR WrapperStruct00.var_1_15 [L109] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) [L109] EXPR WrapperStruct00.var_1_1 [L109] EXPR WrapperStruct00.var_1_6 [L109] EXPR (((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10))) [L109] EXPR WrapperStruct00.var_1_2 [L109] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14) [L109] EXPR WrapperStruct00.var_1_14 [L109] EXPR ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)) [L109] EXPR WrapperStruct00.var_1_7 [L109] EXPR WrapperStruct00.var_1_10 [L109] EXPR (WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10))) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)))) && ((2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1)) [L109] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1) [L109] EXPR WrapperStruct00.var_1_11 [L109] EXPR WrapperStruct00.var_1_10 [L109] EXPR WrapperStruct00.var_1_8 [L109] EXPR (2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)))) && ((2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)))) && ((2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1))) && (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)))) && ((2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1))) && (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_16)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)))) && ((2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1))) && (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_16 == ((signed short int) WrapperStruct00.var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109-L110] return ((((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)))) && ((2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1))) && (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_16 == ((signed short int) WrapperStruct00.var_1_14)) ; [L119] RET, EXPR property() [L119] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.2s, OverallIterations: 20, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2926 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2921 mSDsluCounter, 9159 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6900 mSDsCounter, 702 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6568 IncrementalHoareTripleChecker+Invalid, 7270 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 702 mSolverCounterUnsat, 2259 mSDtfsCounter, 6568 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2114 GetRequests, 1853 SyntacticMatches, 11 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1663 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=19, InterpolantAutomatonStates: 168, 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, 19 MinimizatonAttempts, 206 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 3876 NumberOfCodeBlocks, 3876 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3948 ConstructedInterpolants, 1 QuantifiedInterpolants, 25305 SizeOfPredicates, 26 NumberOfNonLiveVariables, 4632 ConjunctsInSsa, 264 ConjunctsInUnsatCore, 31 InterpolantComputations, 16 PerfectInterpolantSequences, 12590/13020 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:51:31,341 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-s_file-37.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 e1208277e71e1c3dcb7bf16b04051e4f527abbe326e9bfc724844bd2d70dc86a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:51:33,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:51:33,228 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:51:33,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:51:33,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:51:33,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:51:33,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:51:33,284 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:51:33,288 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:51:33,288 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:51:33,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:51:33,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:51:33,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:51:33,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:51:33,288 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:51:33,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:51:33,288 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:51:33,288 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:51:33,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:51:33,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:51:33,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:51:33,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:51:33,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:51:33,289 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:51:33,289 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:51:33,289 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:51:33,289 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:51:33,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:51:33,289 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:51:33,295 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:51:33,296 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:51:33,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:51:33,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:51:33,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:51:33,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:51:33,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:51:33,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:51:33,296 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:51:33,296 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:51:33,296 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:51:33,296 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:51:33,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:51:33,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:51:33,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:51:33,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:51:33,297 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 -> e1208277e71e1c3dcb7bf16b04051e4f527abbe326e9bfc724844bd2d70dc86a [2025-02-06 03:51:33,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:51:33,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:51:33,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:51:33,587 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:51:33,587 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:51:33,592 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-s_file-37.i [2025-02-06 03:51:34,817 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d403977ae/7ba20b3791604446ac0999bc640a9a1f/FLAG88d077a7d [2025-02-06 03:51:35,019 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:51:35,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-37.i [2025-02-06 03:51:35,028 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d403977ae/7ba20b3791604446ac0999bc640a9a1f/FLAG88d077a7d [2025-02-06 03:51:35,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d403977ae/7ba20b3791604446ac0999bc640a9a1f [2025-02-06 03:51:35,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:51:35,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:51:35,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:51:35,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:51:35,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:51:35,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:51:35" (1/1) ... [2025-02-06 03:51:35,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@281394a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:51:35, skipping insertion in model container [2025-02-06 03:51:35,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:51:35" (1/1) ... [2025-02-06 03:51:35,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:51:35,511 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-s_file-37.i[916,929] [2025-02-06 03:51:35,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:51:35,568 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:51:35,581 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-s_file-37.i[916,929] [2025-02-06 03:51:35,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:51:35,633 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:51:35,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:51:35 WrapperNode [2025-02-06 03:51:35,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:51:35,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:51:35,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:51:35,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:51:35,641 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:51:35" (1/1) ... [2025-02-06 03:51:35,658 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:51:35" (1/1) ... [2025-02-06 03:51:35,691 INFO L138 Inliner]: procedures = 37, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 439 [2025-02-06 03:51:35,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:51:35,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:51:35,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:51:35,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:51:35,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:51:35" (1/1) ... [2025-02-06 03:51:35,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:51:35" (1/1) ... [2025-02-06 03:51:35,709 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:51:35" (1/1) ... [2025-02-06 03:51:35,737 INFO L175 MemorySlicer]: Split 125 memory accesses to 2 slices as follows [2, 123]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32]. [2025-02-06 03:51:35,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:51:35" (1/1) ... [2025-02-06 03:51:35,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:51:35" (1/1) ... [2025-02-06 03:51:35,761 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:51:35" (1/1) ... [2025-02-06 03:51:35,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:51:35" (1/1) ... [2025-02-06 03:51:35,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:51:35" (1/1) ... [2025-02-06 03:51:35,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:51:35" (1/1) ... [2025-02-06 03:51:35,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:51:35,776 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:51:35,779 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:51:35,779 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:51:35,781 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:51:35" (1/1) ... [2025-02-06 03:51:35,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:51:35,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:51:35,818 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:51:35,820 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:51:35,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:51:35,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:51:35,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:51:35,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:51:35,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:51:35,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:51:35,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:51:35,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:51:35,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:51:35,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:51:35,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:51:35,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-02-06 03:51:35,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-02-06 03:51:35,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:51:35,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:51:35,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-02-06 03:51:35,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-02-06 03:51:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 03:51:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 03:51:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:51:35,841 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:51:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-02-06 03:51:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-02-06 03:51:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:51:35,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:51:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:51:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:51:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:51:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:51:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:51:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:51:35,937 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:51:35,939 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:51:36,308 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite78#1;havoc property_#t~mem75#1;havoc property_#t~mem74#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~mem83#1;havoc property_#t~mem79#1;havoc property_#t~ite82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem86#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~short91#1;havoc property_#t~mem92#1;havoc property_#t~ite114#1;havoc property_#t~mem95#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem101#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem102#1;havoc property_#t~ite113#1;havoc property_#t~mem112#1;havoc property_#t~mem103#1;havoc property_#t~ite105#1;havoc property_#t~mem104#1;havoc property_#t~mem106#1;havoc property_#t~ite111#1;havoc property_#t~mem107#1;havoc property_#t~ite109#1;havoc property_#t~mem108#1;havoc property_#t~mem110#1;havoc property_#t~short115#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short121#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~short124#1; [2025-02-06 03:51:36,364 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2025-02-06 03:51:36,364 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:51:36,379 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:51:36,379 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:51:36,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:51:36 BoogieIcfgContainer [2025-02-06 03:51:36,380 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:51:36,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:51:36,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:51:36,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:51:36,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:51:35" (1/3) ... [2025-02-06 03:51:36,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d993689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:51:36, skipping insertion in model container [2025-02-06 03:51:36,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:51:35" (2/3) ... [2025-02-06 03:51:36,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d993689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:51:36, skipping insertion in model container [2025-02-06 03:51:36,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:51:36" (3/3) ... [2025-02-06 03:51:36,391 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-37.i [2025-02-06 03:51:36,409 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:51:36,411 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-37.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:51:36,465 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:51:36,481 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;@3930815b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:51:36,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:51:36,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 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:51:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:51:36,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:36,499 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:51:36,500 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:36,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:36,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1440740167, now seen corresponding path program 1 times [2025-02-06 03:51:36,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:51:36,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389678095] [2025-02-06 03:51:36,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:36,518 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:51:36,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:51:36,524 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:51:36,528 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:51:36,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:51:36,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:51:36,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:36,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:36,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:51:36,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:51:36,849 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 03:51:36,850 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:51:36,850 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:51:36,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389678095] [2025-02-06 03:51:36,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389678095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:36,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:36,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:51:36,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014978094] [2025-02-06 03:51:36,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:36,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:51:36,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:51:36,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:51:36,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:51:36,874 INFO L87 Difference]: Start difference. First operand has 96 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 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 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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:51:36,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:36,898 INFO L93 Difference]: Finished difference Result 186 states and 286 transitions. [2025-02-06 03:51:36,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:51:36,900 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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 122 [2025-02-06 03:51:36,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:36,910 INFO L225 Difference]: With dead ends: 186 [2025-02-06 03:51:36,910 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 03:51:36,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 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:51:36,914 INFO L435 NwaCegarLoop]: 133 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, 133 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:51:36,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:51:36,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 03:51:36,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-06 03:51:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 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:51:36,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2025-02-06 03:51:36,938 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 122 [2025-02-06 03:51:36,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:36,938 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2025-02-06 03:51:36,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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:51:36,938 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2025-02-06 03:51:36,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:51:36,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:36,941 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:51:36,948 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 (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:51:37,145 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:51:37,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:37,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:37,146 INFO L85 PathProgramCache]: Analyzing trace with hash -201986512, now seen corresponding path program 1 times [2025-02-06 03:51:37,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:51:37,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485589942] [2025-02-06 03:51:37,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:37,149 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:51:37,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:51:37,155 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:51:37,157 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:51:37,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:51:37,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:51:37,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:37,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:37,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:51:37,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:51:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-02-06 03:51:37,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:51:37,404 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:51:37,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485589942] [2025-02-06 03:51:37,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485589942] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:37,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:37,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:51:37,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899384177] [2025-02-06 03:51:37,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:37,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:51:37,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:51:37,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:51:37,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:51:37,406 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:51:37,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:37,440 INFO L93 Difference]: Finished difference Result 185 states and 266 transitions. [2025-02-06 03:51:37,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:51:37,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 122 [2025-02-06 03:51:37,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:37,441 INFO L225 Difference]: With dead ends: 185 [2025-02-06 03:51:37,441 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 03:51:37,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 119 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:51:37,442 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 382 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:51:37,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:51:37,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 03:51:37,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-02-06 03:51:37,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 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:51:37,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2025-02-06 03:51:37,449 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 122 [2025-02-06 03:51:37,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:37,449 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2025-02-06 03:51:37,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:51:37,449 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2025-02-06 03:51:37,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:51:37,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:37,450 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:51:37,460 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:51:37,651 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:51:37,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:37,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:37,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1498753967, now seen corresponding path program 1 times [2025-02-06 03:51:37,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:51:37,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315016413] [2025-02-06 03:51:37,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:37,652 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:51:37,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:51:37,659 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:51:37,660 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:51:37,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:51:37,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:51:37,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:37,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:37,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:51:37,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:51:37,876 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:51:37,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:51:37,876 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:51:37,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315016413] [2025-02-06 03:51:37,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315016413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:37,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:37,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:51:37,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186517562] [2025-02-06 03:51:37,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:37,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:51:37,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:51:37,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:51:37,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:51:37,877 INFO L87 Difference]: Start difference. First operand 95 states and 135 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:51:37,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:37,916 INFO L93 Difference]: Finished difference Result 192 states and 274 transitions. [2025-02-06 03:51:37,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:51:37,922 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:51:37,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:37,924 INFO L225 Difference]: With dead ends: 192 [2025-02-06 03:51:37,924 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 03:51:37,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:51:37,925 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:37,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 496 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:51:37,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 03:51:37,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-02-06 03:51:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.329268292682927) internal successors, (109), 82 states have internal predecessors, (109), 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:51:37,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2025-02-06 03:51:37,936 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 122 [2025-02-06 03:51:37,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:37,936 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2025-02-06 03:51:37,937 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:51:37,937 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2025-02-06 03:51:37,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:51:37,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:37,938 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:51:37,950 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:51:38,139 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:51:38,139 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:38,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:38,141 INFO L85 PathProgramCache]: Analyzing trace with hash -308700496, now seen corresponding path program 1 times [2025-02-06 03:51:38,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:51:38,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148528819] [2025-02-06 03:51:38,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:38,142 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:51:38,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:51:38,145 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:51:38,149 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:51:38,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:51:38,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:51:38,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:38,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:38,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:51:38,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:51:38,362 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:51:38,363 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:51:38,364 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:51:38,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148528819] [2025-02-06 03:51:38,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148528819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:38,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:38,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:51:38,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086621101] [2025-02-06 03:51:38,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:38,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:51:38,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:51:38,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:51:38,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:51:38,365 INFO L87 Difference]: Start difference. First operand 99 states and 139 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:51:38,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:38,430 INFO L93 Difference]: Finished difference Result 198 states and 279 transitions. [2025-02-06 03:51:38,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:51:38,431 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:51:38,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:38,432 INFO L225 Difference]: With dead ends: 198 [2025-02-06 03:51:38,432 INFO L226 Difference]: Without dead ends: 102 [2025-02-06 03:51:38,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:51:38,433 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:38,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 610 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:51:38,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-06 03:51:38,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-02-06 03:51:38,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 84 states have internal predecessors, (111), 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:51:38,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2025-02-06 03:51:38,446 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 122 [2025-02-06 03:51:38,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:38,446 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2025-02-06 03:51:38,446 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:51:38,446 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2025-02-06 03:51:38,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:51:38,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:38,448 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:51:38,454 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:51:38,648 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:51:38,648 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:38,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:38,649 INFO L85 PathProgramCache]: Analyzing trace with hash 578803185, now seen corresponding path program 1 times [2025-02-06 03:51:38,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:51:38,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383303930] [2025-02-06 03:51:38,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:38,651 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:51:38,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:51:38,653 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:51:38,654 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:51:38,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:51:38,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:51:38,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:38,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:38,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:51:38,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:51:38,869 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:51:38,869 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:51:38,870 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:51:38,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383303930] [2025-02-06 03:51:38,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383303930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:38,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:38,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:51:38,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240238995] [2025-02-06 03:51:38,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:38,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:51:38,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:51:38,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:51:38,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:51:38,871 INFO L87 Difference]: Start difference. First operand 101 states and 141 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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:51:38,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:38,931 INFO L93 Difference]: Finished difference Result 202 states and 283 transitions. [2025-02-06 03:51:38,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:51:38,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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:51:38,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:38,932 INFO L225 Difference]: With dead ends: 202 [2025-02-06 03:51:38,932 INFO L226 Difference]: Without dead ends: 104 [2025-02-06 03:51:38,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:51:38,933 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:38,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 725 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:51:38,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-06 03:51:38,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-02-06 03:51:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.313953488372093) internal successors, (113), 86 states have internal predecessors, (113), 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:51:38,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 143 transitions. [2025-02-06 03:51:38,939 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 143 transitions. Word has length 122 [2025-02-06 03:51:38,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:38,940 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 143 transitions. [2025-02-06 03:51:38,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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:51:38,940 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 143 transitions. [2025-02-06 03:51:38,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:51:38,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:38,941 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:51:38,947 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 (6)] Forceful destruction successful, exit code 0 [2025-02-06 03:51:39,145 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:51:39,145 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:39,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:39,146 INFO L85 PathProgramCache]: Analyzing trace with hash 579726706, now seen corresponding path program 1 times [2025-02-06 03:51:39,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:51:39,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973515466] [2025-02-06 03:51:39,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:39,146 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:51:39,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:51:39,148 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:51:39,150 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:51:39,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:51:39,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:51:39,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:39,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:39,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 03:51:39,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:51:39,399 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:51:39,450 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 26 treesize of output 25 [2025-02-06 03:51:39,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:39,592 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 36 treesize of output 38 [2025-02-06 03:51:39,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:39,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 [2025-02-06 03:51:39,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:39,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 [2025-02-06 03:51:39,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:39,978 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 43 treesize of output 19 [2025-02-06 03:51:40,001 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 286 proven. 24 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-02-06 03:51:40,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:51:40,174 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:51:40,174 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:51:40,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973515466] [2025-02-06 03:51:40,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973515466] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:51:40,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:51:40,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2025-02-06 03:51:40,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957728796] [2025-02-06 03:51:40,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:51:40,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:51:40,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:51:40,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:51:40,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:51:40,175 INFO L87 Difference]: Start difference. First operand 103 states and 143 transitions. Second operand has 13 states, 11 states have (on average 7.181818181818182) internal successors, (79), 13 states have internal predecessors, (79), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-02-06 03:51:41,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:41,052 INFO L93 Difference]: Finished difference Result 217 states and 294 transitions. [2025-02-06 03:51:41,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 03:51:41,053 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.181818181818182) internal successors, (79), 13 states have internal predecessors, (79), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 122 [2025-02-06 03:51:41,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:41,054 INFO L225 Difference]: With dead ends: 217 [2025-02-06 03:51:41,055 INFO L226 Difference]: Without dead ends: 117 [2025-02-06 03:51:41,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:51:41,056 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 303 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:41,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 234 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:51:41,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-06 03:51:41,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2025-02-06 03:51:41,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:51:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 151 transitions. [2025-02-06 03:51:41,076 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 151 transitions. Word has length 122 [2025-02-06 03:51:41,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:41,077 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 151 transitions. [2025-02-06 03:51:41,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.181818181818182) internal successors, (79), 13 states have internal predecessors, (79), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-02-06 03:51:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 151 transitions. [2025-02-06 03:51:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:51:41,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:41,080 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:51:41,095 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:51:41,280 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:51:41,281 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:41,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:41,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1824491187, now seen corresponding path program 1 times [2025-02-06 03:51:41,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:51:41,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057845170] [2025-02-06 03:51:41,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:41,283 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:51:41,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:51:41,289 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:51:41,290 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:51:41,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:51:41,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:51:41,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:41,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:41,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 03:51:41,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:51:41,544 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:51:41,616 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 31 treesize of output 15 [2025-02-06 03:51:41,644 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 26 treesize of output 25 [2025-02-06 03:51:41,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2025-02-06 03:51:42,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:42,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 62 treesize of output 46 [2025-02-06 03:51:42,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:42,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 57 treesize of output 56 [2025-02-06 03:51:42,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:42,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 72 treesize of output 59 [2025-02-06 03:51:42,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:42,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 72 treesize of output 59 [2025-02-06 03:51:42,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:42,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 89 treesize of output 83 [2025-02-06 03:51:42,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:42,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 87 treesize of output 39 [2025-02-06 03:51:42,934 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 289 proven. 63 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-06 03:51:42,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:51:43,289 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:51:43,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057845170] [2025-02-06 03:51:43,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057845170] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:51:43,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1505087840] [2025-02-06 03:51:43,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:43,290 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:51:43,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:51:43,299 INFO L229 MonitoredProcess]: Starting monitored process 9 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:51:43,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-02-06 03:51:43,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:51:43,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:51:43,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:43,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:43,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 03:51:43,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:51:43,823 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-02-06 03:51:43,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2025-02-06 03:51:44,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:44,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2025-02-06 03:51:44,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2025-02-06 03:51:44,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:44,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-02-06 03:51:44,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:44,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 47 [2025-02-06 03:51:44,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:44,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 47 [2025-02-06 03:51:44,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:44,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 47 [2025-02-06 03:51:45,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 67 [2025-02-06 03:51:45,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:45,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 77 treesize of output 37 [2025-02-06 03:51:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 245 proven. 63 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:51:45,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:51:45,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1505087840] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:51:45,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:51:45,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2025-02-06 03:51:45,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120818136] [2025-02-06 03:51:45,532 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:51:45,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-06 03:51:45,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:51:45,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 03:51:45,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1132, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 03:51:45,535 INFO L87 Difference]: Start difference. First operand 115 states and 151 transitions. Second operand has 29 states, 25 states have (on average 4.36) internal successors, (109), 28 states have internal predecessors, (109), 12 states have call successors, (30), 11 states have call predecessors, (30), 12 states have return successors, (30), 8 states have call predecessors, (30), 12 states have call successors, (30) [2025-02-06 03:51:49,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:49,268 INFO L93 Difference]: Finished difference Result 251 states and 319 transitions. [2025-02-06 03:51:49,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-02-06 03:51:49,270 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 4.36) internal successors, (109), 28 states have internal predecessors, (109), 12 states have call successors, (30), 11 states have call predecessors, (30), 12 states have return successors, (30), 8 states have call predecessors, (30), 12 states have call successors, (30) Word has length 122 [2025-02-06 03:51:49,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:49,271 INFO L225 Difference]: With dead ends: 251 [2025-02-06 03:51:49,271 INFO L226 Difference]: Without dead ends: 139 [2025-02-06 03:51:49,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 370 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1143 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=870, Invalid=3290, Unknown=0, NotChecked=0, Total=4160 [2025-02-06 03:51:49,273 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 487 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:49,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 631 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-06 03:51:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-06 03:51:49,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2025-02-06 03:51:49,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 107 states have (on average 1.233644859813084) internal successors, (132), 107 states have internal predecessors, (132), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:51:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2025-02-06 03:51:49,295 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 122 [2025-02-06 03:51:49,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:49,296 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2025-02-06 03:51:49,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 4.36) internal successors, (109), 28 states have internal predecessors, (109), 12 states have call successors, (30), 11 states have call predecessors, (30), 12 states have return successors, (30), 8 states have call predecessors, (30), 12 states have call successors, (30) [2025-02-06 03:51:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2025-02-06 03:51:49,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:51:49,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:49,300 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:51:49,308 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 (8)] Forceful destruction successful, exit code 0 [2025-02-06 03:51:49,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2025-02-06 03:51:49,705 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,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:51:49,706 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:49,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:49,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2035842100, now seen corresponding path program 1 times [2025-02-06 03:51:49,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:51:49,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182640449] [2025-02-06 03:51:49,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:49,707 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:51:49,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:51:49,709 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:51:49,711 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:51:49,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:51:49,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:51:49,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:49,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:49,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-06 03:51:49,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:51:49,950 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 14 treesize of output 10 [2025-02-06 03:51:50,068 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 36 treesize of output 29 [2025-02-06 03:51:50,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:50,291 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 62 treesize of output 37 [2025-02-06 03:51:50,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 37 [2025-02-06 03:51:51,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:51,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 89 treesize of output 70 [2025-02-06 03:51:51,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:51,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 99 treesize of output 83 [2025-02-06 03:51:51,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:51,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 81 [2025-02-06 03:51:51,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:51,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 81 [2025-02-06 03:51:52,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:52,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 120 treesize of output 105 [2025-02-06 03:51:52,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:52,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 120 treesize of output 113 [2025-02-06 03:51:52,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:52,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 152 treesize of output 62 [2025-02-06 03:51:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 267 proven. 102 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-06 03:51:52,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:51:58,126 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:51:58,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182640449] [2025-02-06 03:51:58,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182640449] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:51:58,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [474869323] [2025-02-06 03:51:58,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:58,127 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:51:58,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:51:58,130 INFO L229 MonitoredProcess]: Starting monitored process 11 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:51:58,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2025-02-06 03:51:58,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:51:58,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:51:58,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:58,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:58,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-06 03:51:58,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:51:58,753 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-02-06 03:51:59,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2025-02-06 03:52:00,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:00,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2025-02-06 03:52:02,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2025-02-06 03:52:12,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:12,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 60 [2025-02-06 03:52:14,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:14,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 71 [2025-02-06 03:52:15,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:15,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 74 [2025-02-06 03:52:16,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:16,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 74 [2025-02-06 03:52:16,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:16,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 94 [2025-02-06 03:52:16,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:16,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 105 treesize of output 109 [2025-02-06 03:52:16,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:16,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 134 treesize of output 66 [2025-02-06 03:52:16,849 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 267 proven. 102 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-06 03:52:16,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:52:18,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [474869323] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:52:18,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:52:18,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2025-02-06 03:52:18,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961761425] [2025-02-06 03:52:18,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:52:18,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-06 03:52:18,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:52:18,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-06 03:52:18,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=642, Invalid=2780, Unknown=0, NotChecked=0, Total=3422 [2025-02-06 03:52:18,239 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand has 48 states, 40 states have (on average 3.225) internal successors, (129), 42 states have internal predecessors, (129), 18 states have call successors, (30), 14 states have call predecessors, (30), 18 states have return successors, (30), 15 states have call predecessors, (30), 18 states have call successors, (30)