./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.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-53.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 a57c51c3c35fc35fae3b673a01ba8d307f47b0272dfabe8304d0498d3ff6eff6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:53:04,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:53:04,313 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:53:04,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:53:04,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:53:04,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:53:04,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:53:04,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:53:04,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:53:04,337 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:53:04,337 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:53:04,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:53:04,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:53:04,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:53:04,338 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:53:04,338 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:53:04,338 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:53:04,339 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:53:04,339 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:53:04,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:53:04,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:53:04,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:53:04,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:53:04,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:53:04,339 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:53:04,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:53:04,339 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:53:04,340 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:53:04,340 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:53:04,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:53:04,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:53:04,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:53:04,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:53:04,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:53:04,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:53:04,340 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:53:04,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:53:04,340 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:53:04,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:53:04,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:53:04,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:53:04,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:53:04,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:53:04,341 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 -> a57c51c3c35fc35fae3b673a01ba8d307f47b0272dfabe8304d0498d3ff6eff6 [2025-02-06 03:53:04,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:53:04,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:53:04,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:53:04,584 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:53:04,585 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:53:04,586 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-53.i [2025-02-06 03:53:05,891 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fbd684f9/60d8815212244b1b8b3b847a332f8ea7/FLAG286f64186 [2025-02-06 03:53:06,160 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:53:06,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i [2025-02-06 03:53:06,178 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fbd684f9/60d8815212244b1b8b3b847a332f8ea7/FLAG286f64186 [2025-02-06 03:53:06,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fbd684f9/60d8815212244b1b8b3b847a332f8ea7 [2025-02-06 03:53:06,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:53:06,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:53:06,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:53:06,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:53:06,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:53:06,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:53:06" (1/1) ... [2025-02-06 03:53:06,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c29319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:06, skipping insertion in model container [2025-02-06 03:53:06,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:53:06" (1/1) ... [2025-02-06 03:53:06,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:53:06,382 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-53.i[916,929] [2025-02-06 03:53:06,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:53:06,444 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:53:06,454 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-53.i[916,929] [2025-02-06 03:53:06,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:53:06,499 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:53:06,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:06 WrapperNode [2025-02-06 03:53:06,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:53:06,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:53:06,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:53:06,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:53:06,506 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:53:06" (1/1) ... [2025-02-06 03:53:06,518 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:53:06" (1/1) ... [2025-02-06 03:53:06,564 INFO L138 Inliner]: procedures = 30, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 484 [2025-02-06 03:53:06,565 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:53:06,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:53:06,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:53:06,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:53:06,576 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:06" (1/1) ... [2025-02-06 03:53:06,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:06" (1/1) ... [2025-02-06 03:53:06,584 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:06" (1/1) ... [2025-02-06 03:53:06,595 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 03:53:06,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:06" (1/1) ... [2025-02-06 03:53:06,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:06" (1/1) ... [2025-02-06 03:53:06,613 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:06" (1/1) ... [2025-02-06 03:53:06,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:06" (1/1) ... [2025-02-06 03:53:06,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:06" (1/1) ... [2025-02-06 03:53:06,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:06" (1/1) ... [2025-02-06 03:53:06,626 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:53:06,627 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:53:06,627 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:53:06,627 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:53:06,628 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:06" (1/1) ... [2025-02-06 03:53:06,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:53:06,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:53:06,662 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:53:06,668 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:53:06,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:53:06,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 03:53:06,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 03:53:06,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 03:53:06,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 03:53:06,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 03:53:06,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 03:53:06,686 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:53:06,686 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:53:06,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 03:53:06,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:53:06,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:53:06,806 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:53:06,809 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:53:07,292 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~short89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~ite94#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite116#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite113#1;havoc property_#t~mem102#1;havoc property_#t~ite112#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~ite111#1;havoc property_#t~mem108#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~short107#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~short117#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem121#1;havoc property_#t~ite124#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short127#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite136#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~mem135#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~short134#1;havoc property_#t~short137#1; [2025-02-06 03:53:07,342 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-02-06 03:53:07,343 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:53:07,354 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:53:07,355 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:53:07,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:53:07 BoogieIcfgContainer [2025-02-06 03:53:07,355 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:53:07,357 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:53:07,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:53:07,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:53:07,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:53:06" (1/3) ... [2025-02-06 03:53:07,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4edbafb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:53:07, skipping insertion in model container [2025-02-06 03:53:07,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:06" (2/3) ... [2025-02-06 03:53:07,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4edbafb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:53:07, skipping insertion in model container [2025-02-06 03:53:07,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:53:07" (3/3) ... [2025-02-06 03:53:07,365 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-53.i [2025-02-06 03:53:07,381 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:53:07,382 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-53.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:53:07,446 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:53:07,459 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;@3213215, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:53:07,462 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:53:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 90 states have (on average 1.4) internal successors, (126), 91 states have internal predecessors, (126), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:53:07,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 03:53:07,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:07,480 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:07,480 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:07,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:07,488 INFO L85 PathProgramCache]: Analyzing trace with hash -914957863, now seen corresponding path program 1 times [2025-02-06 03:53:07,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:53:07,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429085961] [2025-02-06 03:53:07,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:07,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:53:07,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 03:53:07,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 03:53:07,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:07,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:07,885 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:53:07,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:53:07,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429085961] [2025-02-06 03:53:07,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429085961] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:53:07,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528520618] [2025-02-06 03:53:07,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:07,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:53:07,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:53:07,890 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:53:07,892 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:53:08,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 03:53:08,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 03:53:08,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:08,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:08,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:53:08,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:53:08,214 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:53:08,216 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:53:08,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528520618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:08,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:53:08,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:53:08,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940412903] [2025-02-06 03:53:08,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:08,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:53:08,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:53:08,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:53:08,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:53:08,243 INFO L87 Difference]: Start difference. First operand has 111 states, 90 states have (on average 1.4) internal successors, (126), 91 states have internal predecessors, (126), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:53:08,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:08,269 INFO L93 Difference]: Finished difference Result 216 states and 337 transitions. [2025-02-06 03:53:08,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:53:08,271 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2025-02-06 03:53:08,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:08,277 INFO L225 Difference]: With dead ends: 216 [2025-02-06 03:53:08,277 INFO L226 Difference]: Without dead ends: 108 [2025-02-06 03:53:08,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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:53:08,282 INFO L435 NwaCegarLoop]: 155 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, 155 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:53:08,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:53:08,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-06 03:53:08,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-06 03:53:08,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:53:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2025-02-06 03:53:08,323 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 140 [2025-02-06 03:53:08,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:08,325 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2025-02-06 03:53:08,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:53:08,326 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2025-02-06 03:53:08,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 03:53:08,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:08,333 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:08,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:53:08,534 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:53:08,535 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:08,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:08,535 INFO L85 PathProgramCache]: Analyzing trace with hash -259387639, now seen corresponding path program 1 times [2025-02-06 03:53:08,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:53:08,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127115432] [2025-02-06 03:53:08,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:08,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:53:08,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 03:53:08,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 03:53:08,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:08,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:53:09,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:53:09,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127115432] [2025-02-06 03:53:09,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127115432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:09,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:09,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:53:09,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606079992] [2025-02-06 03:53:09,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:09,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:53:09,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:53:09,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:53:09,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:53:09,271 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:53:09,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:09,315 INFO L93 Difference]: Finished difference Result 213 states and 307 transitions. [2025-02-06 03:53:09,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:53:09,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2025-02-06 03:53:09,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:09,318 INFO L225 Difference]: With dead ends: 213 [2025-02-06 03:53:09,318 INFO L226 Difference]: Without dead ends: 108 [2025-02-06 03:53:09,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:53:09,320 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:09,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:53:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-06 03:53:09,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-06 03:53:09,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:53:09,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2025-02-06 03:53:09,330 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 140 [2025-02-06 03:53:09,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:09,332 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2025-02-06 03:53:09,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:53:09,332 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2025-02-06 03:53:09,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 03:53:09,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:09,335 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:09,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:53:09,335 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:09,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:09,336 INFO L85 PathProgramCache]: Analyzing trace with hash -769921816, now seen corresponding path program 1 times [2025-02-06 03:53:09,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:53:09,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100371190] [2025-02-06 03:53:09,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:09,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:53:09,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 03:53:09,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 03:53:09,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:09,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:53:11,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:53:11,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100371190] [2025-02-06 03:53:11,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100371190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:11,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:11,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:53:11,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841832400] [2025-02-06 03:53:11,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:11,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:53:11,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:53:11,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:53:11,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:53:11,664 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:53:12,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:12,075 INFO L93 Difference]: Finished difference Result 219 states and 311 transitions. [2025-02-06 03:53:12,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:53:12,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2025-02-06 03:53:12,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:12,081 INFO L225 Difference]: With dead ends: 219 [2025-02-06 03:53:12,081 INFO L226 Difference]: Without dead ends: 114 [2025-02-06 03:53:12,082 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:53:12,083 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 85 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:12,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 404 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:53:12,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-06 03:53:12,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-02-06 03:53:12,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 93 states have internal predecessors, (123), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:53:12,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2025-02-06 03:53:12,102 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 140 [2025-02-06 03:53:12,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:12,102 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2025-02-06 03:53:12,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:53:12,103 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2025-02-06 03:53:12,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 03:53:12,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:12,104 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:12,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:53:12,105 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:12,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:12,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1728094121, now seen corresponding path program 1 times [2025-02-06 03:53:12,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:53:12,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869251195] [2025-02-06 03:53:12,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:12,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:53:12,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 03:53:12,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 03:53:12,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:12,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:53:15,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:53:15,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869251195] [2025-02-06 03:53:15,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869251195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:15,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:15,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:53:15,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839409157] [2025-02-06 03:53:15,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:15,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:53:15,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:53:15,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:53:15,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:53:15,477 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:53:16,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:16,436 INFO L93 Difference]: Finished difference Result 336 states and 470 transitions. [2025-02-06 03:53:16,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:53:16,436 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 140 [2025-02-06 03:53:16,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:16,439 INFO L225 Difference]: With dead ends: 336 [2025-02-06 03:53:16,441 INFO L226 Difference]: Without dead ends: 225 [2025-02-06 03:53:16,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:53:16,444 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 91 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:16,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 523 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 03:53:16,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-02-06 03:53:16,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 219. [2025-02-06 03:53:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 178 states have (on average 1.3258426966292134) internal successors, (236), 178 states have internal predecessors, (236), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:53:16,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 308 transitions. [2025-02-06 03:53:16,484 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 308 transitions. Word has length 140 [2025-02-06 03:53:16,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:16,486 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 308 transitions. [2025-02-06 03:53:16,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:53:16,487 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 308 transitions. [2025-02-06 03:53:16,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 03:53:16,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:16,491 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:16,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:53:16,491 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:16,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:16,492 INFO L85 PathProgramCache]: Analyzing trace with hash 157838476, now seen corresponding path program 1 times [2025-02-06 03:53:16,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:53:16,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194206030] [2025-02-06 03:53:16,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:16,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:53:16,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 03:53:16,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 03:53:16,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:16,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:19,380 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:53:19,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:53:19,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194206030] [2025-02-06 03:53:19,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194206030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:19,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:19,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:53:19,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531957575] [2025-02-06 03:53:19,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:19,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:53:19,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:53:19,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:53:19,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:53:19,383 INFO L87 Difference]: Start difference. First operand 219 states and 308 transitions. Second operand has 10 states, 7 states have (on average 7.857142857142857) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:53:20,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:20,294 INFO L93 Difference]: Finished difference Result 330 states and 463 transitions. [2025-02-06 03:53:20,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:53:20,295 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 7.857142857142857) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 142 [2025-02-06 03:53:20,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:20,299 INFO L225 Difference]: With dead ends: 330 [2025-02-06 03:53:20,300 INFO L226 Difference]: Without dead ends: 219 [2025-02-06 03:53:20,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:53:20,302 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 183 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:20,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 454 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:53:20,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-06 03:53:20,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 112. [2025-02-06 03:53:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 states have internal predecessors, (119), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:53:20,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 155 transitions. [2025-02-06 03:53:20,327 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 155 transitions. Word has length 142 [2025-02-06 03:53:20,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:20,328 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 155 transitions. [2025-02-06 03:53:20,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 7.857142857142857) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:53:20,329 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 155 transitions. [2025-02-06 03:53:20,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:53:20,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:20,330 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:20,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:53:20,330 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:20,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:20,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2131329426, now seen corresponding path program 1 times [2025-02-06 03:53:20,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:53:20,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500815931] [2025-02-06 03:53:20,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:20,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:53:20,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:53:20,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:53:20,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:20,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:53:20,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:53:20,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500815931] [2025-02-06 03:53:20,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500815931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:20,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:20,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:53:20,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766485589] [2025-02-06 03:53:20,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:20,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:53:20,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:53:20,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:53:20,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:53:20,599 INFO L87 Difference]: Start difference. First operand 112 states and 155 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:53:20,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:20,619 INFO L93 Difference]: Finished difference Result 221 states and 307 transitions. [2025-02-06 03:53:20,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:53:20,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-02-06 03:53:20,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:20,625 INFO L225 Difference]: With dead ends: 221 [2025-02-06 03:53:20,625 INFO L226 Difference]: Without dead ends: 112 [2025-02-06 03:53:20,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:53:20,626 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:20,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:53:20,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-06 03:53:20,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-06 03:53:20,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:53:20,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 154 transitions. [2025-02-06 03:53:20,642 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 154 transitions. Word has length 145 [2025-02-06 03:53:20,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:20,642 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 154 transitions. [2025-02-06 03:53:20,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:53:20,643 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 154 transitions. [2025-02-06 03:53:20,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:53:20,644 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:20,644 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:20,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:53:20,644 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:20,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:20,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1870234863, now seen corresponding path program 1 times [2025-02-06 03:53:20,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:53:20,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501836273] [2025-02-06 03:53:20,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:20,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:53:20,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:53:20,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:53:20,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:20,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:53:21,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:53:21,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501836273] [2025-02-06 03:53:21,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501836273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:21,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:21,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:53:21,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770792362] [2025-02-06 03:53:21,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:21,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:53:21,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:53:21,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:53:21,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:53:21,726 INFO L87 Difference]: Start difference. First operand 112 states and 154 transitions. Second operand has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:53:22,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:22,363 INFO L93 Difference]: Finished difference Result 299 states and 409 transitions. [2025-02-06 03:53:22,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:53:22,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 145 [2025-02-06 03:53:22,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:22,366 INFO L225 Difference]: With dead ends: 299 [2025-02-06 03:53:22,366 INFO L226 Difference]: Without dead ends: 190 [2025-02-06 03:53:22,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:53:22,367 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 86 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:22,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 875 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:53:22,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-06 03:53:22,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2025-02-06 03:53:22,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 154 states have (on average 1.2922077922077921) internal successors, (199), 155 states have internal predecessors, (199), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:53:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 255 transitions. [2025-02-06 03:53:22,391 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 255 transitions. Word has length 145 [2025-02-06 03:53:22,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:22,391 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 255 transitions. [2025-02-06 03:53:22,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:53:22,392 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 255 transitions. [2025-02-06 03:53:22,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 03:53:22,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:22,395 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:22,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:53:22,396 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:22,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:22,396 INFO L85 PathProgramCache]: Analyzing trace with hash 913869775, now seen corresponding path program 1 times [2025-02-06 03:53:22,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:53:22,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493633176] [2025-02-06 03:53:22,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:22,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:53:22,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 03:53:22,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 03:53:22,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:22,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:23,978 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:53:23,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:53:23,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493633176] [2025-02-06 03:53:23,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493633176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:23,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:23,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:53:23,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718583953] [2025-02-06 03:53:23,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:23,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:53:23,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:53:23,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:53:23,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:53:23,981 INFO L87 Difference]: Start difference. First operand 187 states and 255 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:53:25,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:25,175 INFO L93 Difference]: Finished difference Result 607 states and 829 transitions. [2025-02-06 03:53:25,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:53:25,175 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2025-02-06 03:53:25,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:25,181 INFO L225 Difference]: With dead ends: 607 [2025-02-06 03:53:25,181 INFO L226 Difference]: Without dead ends: 423 [2025-02-06 03:53:25,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:53:25,183 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 153 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:25,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 616 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 03:53:25,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-02-06 03:53:25,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 416. [2025-02-06 03:53:25,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 348 states have (on average 1.3074712643678161) internal successors, (455), 351 states have internal predecessors, (455), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:53:25,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 571 transitions. [2025-02-06 03:53:25,232 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 571 transitions. Word has length 146 [2025-02-06 03:53:25,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:25,233 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 571 transitions. [2025-02-06 03:53:25,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:53:25,233 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 571 transitions. [2025-02-06 03:53:25,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 03:53:25,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:25,234 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:25,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:53:25,234 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:25,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:25,235 INFO L85 PathProgramCache]: Analyzing trace with hash -883081584, now seen corresponding path program 1 times [2025-02-06 03:53:25,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:53:25,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270150020] [2025-02-06 03:53:25,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:25,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:53:25,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 03:53:25,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 03:53:25,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:25,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:27,307 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:53:27,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:53:27,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270150020] [2025-02-06 03:53:27,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270150020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:27,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:27,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 03:53:27,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866704036] [2025-02-06 03:53:27,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:27,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:53:27,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:53:27,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:53:27,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:53:27,310 INFO L87 Difference]: Start difference. First operand 416 states and 571 transitions. Second operand has 12 states, 10 states have (on average 5.9) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:53:28,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:28,719 INFO L93 Difference]: Finished difference Result 872 states and 1191 transitions. [2025-02-06 03:53:28,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:53:28,720 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.9) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 146 [2025-02-06 03:53:28,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:28,724 INFO L225 Difference]: With dead ends: 872 [2025-02-06 03:53:28,725 INFO L226 Difference]: Without dead ends: 459 [2025-02-06 03:53:28,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:53:28,727 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 172 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:28,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 751 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 03:53:28,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-02-06 03:53:28,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 422. [2025-02-06 03:53:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 354 states have (on average 1.2966101694915255) internal successors, (459), 357 states have internal predecessors, (459), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:53:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 575 transitions. [2025-02-06 03:53:28,776 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 575 transitions. Word has length 146 [2025-02-06 03:53:28,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:28,776 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 575 transitions. [2025-02-06 03:53:28,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.9) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:53:28,777 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 575 transitions. [2025-02-06 03:53:28,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 03:53:28,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:28,781 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:28,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:53:28,781 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:28,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:28,782 INFO L85 PathProgramCache]: Analyzing trace with hash 505045550, now seen corresponding path program 1 times [2025-02-06 03:53:28,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:53:28,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992756778] [2025-02-06 03:53:28,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:28,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:53:28,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 03:53:28,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 03:53:28,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:28,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:30,002 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:53:30,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:53:30,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992756778] [2025-02-06 03:53:30,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992756778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:30,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:30,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:53:30,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102975710] [2025-02-06 03:53:30,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:30,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:53:30,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:53:30,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:53:30,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:53:30,004 INFO L87 Difference]: Start difference. First operand 422 states and 575 transitions. Second operand has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:53:30,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:30,795 INFO L93 Difference]: Finished difference Result 953 states and 1298 transitions. [2025-02-06 03:53:30,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:53:30,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 146 [2025-02-06 03:53:30,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:30,799 INFO L225 Difference]: With dead ends: 953 [2025-02-06 03:53:30,800 INFO L226 Difference]: Without dead ends: 534 [2025-02-06 03:53:30,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:53:30,802 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 47 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:30,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 776 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:53:30,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-02-06 03:53:30,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 442. [2025-02-06 03:53:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 374 states have (on average 1.2887700534759359) internal successors, (482), 377 states have internal predecessors, (482), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:53:30,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 598 transitions. [2025-02-06 03:53:30,837 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 598 transitions. Word has length 146 [2025-02-06 03:53:30,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:30,838 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 598 transitions. [2025-02-06 03:53:30,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:53:30,838 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 598 transitions. [2025-02-06 03:53:30,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 03:53:30,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:30,840 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:30,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:53:30,840 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:30,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:30,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1291905809, now seen corresponding path program 1 times [2025-02-06 03:53:30,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:53:30,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504376211] [2025-02-06 03:53:30,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:30,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:53:30,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 03:53:30,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 03:53:30,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:30,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:32,123 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:53:32,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:53:32,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504376211] [2025-02-06 03:53:32,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504376211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:32,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:32,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:53:32,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818570943] [2025-02-06 03:53:32,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:32,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:53:32,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:53:32,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:53:32,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:53:32,126 INFO L87 Difference]: Start difference. First operand 442 states and 598 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:53:32,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:32,990 INFO L93 Difference]: Finished difference Result 889 states and 1199 transitions. [2025-02-06 03:53:32,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:53:32,991 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2025-02-06 03:53:32,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:32,994 INFO L225 Difference]: With dead ends: 889 [2025-02-06 03:53:32,994 INFO L226 Difference]: Without dead ends: 450 [2025-02-06 03:53:32,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:53:32,996 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 141 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:32,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 717 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:53:32,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-02-06 03:53:33,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 442. [2025-02-06 03:53:33,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 374 states have (on average 1.286096256684492) internal successors, (481), 377 states have internal predecessors, (481), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:53:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 597 transitions. [2025-02-06 03:53:33,032 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 597 transitions. Word has length 146 [2025-02-06 03:53:33,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:33,032 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 597 transitions. [2025-02-06 03:53:33,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:53:33,033 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 597 transitions. [2025-02-06 03:53:33,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:53:33,035 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:33,035 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:33,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:53:33,036 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:33,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:33,036 INFO L85 PathProgramCache]: Analyzing trace with hash 239737947, now seen corresponding path program 1 times [2025-02-06 03:53:33,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:53:33,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748238281] [2025-02-06 03:53:33,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:33,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:53:33,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:53:33,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:53:33,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:33,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:33,197 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:53:33,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:53:33,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748238281] [2025-02-06 03:53:33,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748238281] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:53:33,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71746522] [2025-02-06 03:53:33,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:33,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:53:33,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:53:33,203 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:53:33,216 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:53:33,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:53:33,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:53:33,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:33,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:33,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:53:33,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:53:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:53:33,543 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:53:33,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71746522] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:33,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:53:33,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-02-06 03:53:33,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660894074] [2025-02-06 03:53:33,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:33,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:53:33,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:53:33,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:53:33,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:53:33,545 INFO L87 Difference]: Start difference. First operand 442 states and 597 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:53:33,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:33,606 INFO L93 Difference]: Finished difference Result 901 states and 1216 transitions. [2025-02-06 03:53:33,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:53:33,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-02-06 03:53:33,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:33,610 INFO L225 Difference]: With dead ends: 901 [2025-02-06 03:53:33,610 INFO L226 Difference]: Without dead ends: 462 [2025-02-06 03:53:33,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:53:33,611 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:33,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 725 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:53:33,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-02-06 03:53:33,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 456. [2025-02-06 03:53:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 388 states have (on average 1.2757731958762886) internal successors, (495), 391 states have internal predecessors, (495), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:53:33,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 611 transitions. [2025-02-06 03:53:33,654 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 611 transitions. Word has length 147 [2025-02-06 03:53:33,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:33,654 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 611 transitions. [2025-02-06 03:53:33,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:53:33,654 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 611 transitions. [2025-02-06 03:53:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:53:33,656 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:33,656 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:33,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:53:33,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:53:33,857 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:33,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:33,858 INFO L85 PathProgramCache]: Analyzing trace with hash -873198583, now seen corresponding path program 1 times [2025-02-06 03:53:33,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:53:33,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169847310] [2025-02-06 03:53:33,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:33,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:53:33,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:53:33,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:53:33,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:33,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:34,102 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:53:34,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:53:34,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169847310] [2025-02-06 03:53:34,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169847310] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:53:34,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256115345] [2025-02-06 03:53:34,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:34,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:53:34,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:53:34,106 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:53:34,108 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:53:34,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:53:34,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:53:34,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:34,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:34,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:53:34,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:53:34,369 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:53:34,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:53:34,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256115345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:34,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:53:34,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:53:34,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498792049] [2025-02-06 03:53:34,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:34,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:53:34,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:53:34,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:53:34,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:53:34,371 INFO L87 Difference]: Start difference. First operand 456 states and 611 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:53:34,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:34,416 INFO L93 Difference]: Finished difference Result 924 states and 1239 transitions. [2025-02-06 03:53:34,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:53:34,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-02-06 03:53:34,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:34,421 INFO L225 Difference]: With dead ends: 924 [2025-02-06 03:53:34,421 INFO L226 Difference]: Without dead ends: 471 [2025-02-06 03:53:34,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:53:34,422 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:34,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 576 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:53:34,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-02-06 03:53:34,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2025-02-06 03:53:34,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 403 states have (on average 1.2655086848635235) internal successors, (510), 406 states have internal predecessors, (510), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 03:53:34,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 626 transitions. [2025-02-06 03:53:34,458 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 626 transitions. Word has length 147 [2025-02-06 03:53:34,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:34,458 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 626 transitions. [2025-02-06 03:53:34,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:53:34,459 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 626 transitions. [2025-02-06 03:53:34,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:53:34,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:34,460 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:34,469 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:53:34,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:53:34,661 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:34,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:34,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1895964046, now seen corresponding path program 1 times [2025-02-06 03:53:34,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:53:34,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171807460] [2025-02-06 03:53:34,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:34,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:53:34,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:53:34,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:53:34,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:34,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:37,517 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:53:37,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:53:37,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171807460] [2025-02-06 03:53:37,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171807460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:37,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:37,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-06 03:53:37,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341296313] [2025-02-06 03:53:37,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:37,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 03:53:37,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:53:37,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 03:53:37,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:53:37,520 INFO L87 Difference]: Start difference. First operand 471 states and 626 transitions. Second operand has 16 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:53:40,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:40,385 INFO L93 Difference]: Finished difference Result 733 states and 973 transitions. [2025-02-06 03:53:40,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 03:53:40,385 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 148 [2025-02-06 03:53:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:40,389 INFO L225 Difference]: With dead ends: 733 [2025-02-06 03:53:40,389 INFO L226 Difference]: Without dead ends: 518 [2025-02-06 03:53:40,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2025-02-06 03:53:40,392 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 255 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 1574 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:40,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 934 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1574 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-06 03:53:40,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-02-06 03:53:40,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 514. [2025-02-06 03:53:40,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 443 states have (on average 1.2663656884875847) internal successors, (561), 447 states have internal predecessors, (561), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:53:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 681 transitions. [2025-02-06 03:53:40,425 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 681 transitions. Word has length 148 [2025-02-06 03:53:40,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:40,425 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 681 transitions. [2025-02-06 03:53:40,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:53:40,426 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 681 transitions. [2025-02-06 03:53:40,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:53:40,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:40,429 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:40,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:53:40,429 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:40,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:40,430 INFO L85 PathProgramCache]: Analyzing trace with hash 602051891, now seen corresponding path program 1 times [2025-02-06 03:53:40,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:53:40,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819110298] [2025-02-06 03:53:40,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:40,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:53:40,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:53:40,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:53:40,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:40,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:40,937 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:53:40,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:53:40,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819110298] [2025-02-06 03:53:40,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819110298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:40,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:40,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:53:40,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062773018] [2025-02-06 03:53:40,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:40,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:53:40,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:53:40,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:53:40,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:53:40,940 INFO L87 Difference]: Start difference. First operand 514 states and 681 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:53:41,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:41,715 INFO L93 Difference]: Finished difference Result 845 states and 1119 transitions. [2025-02-06 03:53:41,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:53:41,716 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2025-02-06 03:53:41,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:41,721 INFO L225 Difference]: With dead ends: 845 [2025-02-06 03:53:41,721 INFO L226 Difference]: Without dead ends: 587 [2025-02-06 03:53:41,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:53:41,724 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 54 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:41,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 686 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:53:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-02-06 03:53:41,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 514. [2025-02-06 03:53:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 443 states have (on average 1.2641083521444696) internal successors, (560), 447 states have internal predecessors, (560), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:53:41,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 680 transitions. [2025-02-06 03:53:41,760 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 680 transitions. Word has length 148 [2025-02-06 03:53:41,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:41,761 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 680 transitions. [2025-02-06 03:53:41,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:53:41,761 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 680 transitions. [2025-02-06 03:53:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:53:41,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:41,763 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:41,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:53:41,763 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:41,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:41,764 INFO L85 PathProgramCache]: Analyzing trace with hash 193227666, now seen corresponding path program 1 times [2025-02-06 03:53:41,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:53:41,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601913635] [2025-02-06 03:53:41,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:41,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:53:41,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:53:41,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:53:41,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:41,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:53:44,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:53:44,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601913635] [2025-02-06 03:53:44,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601913635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:44,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:44,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-06 03:53:44,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641799583] [2025-02-06 03:53:44,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:44,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 03:53:44,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:53:44,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 03:53:44,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:53:44,343 INFO L87 Difference]: Start difference. First operand 514 states and 680 transitions. Second operand has 16 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:53:46,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:46,511 INFO L93 Difference]: Finished difference Result 776 states and 1025 transitions. [2025-02-06 03:53:46,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 03:53:46,512 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 148 [2025-02-06 03:53:46,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:46,515 INFO L225 Difference]: With dead ends: 776 [2025-02-06 03:53:46,516 INFO L226 Difference]: Without dead ends: 518 [2025-02-06 03:53:46,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2025-02-06 03:53:46,518 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 226 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:46,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1057 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 03:53:46,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-02-06 03:53:46,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 514. [2025-02-06 03:53:46,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 443 states have (on average 1.2618510158013545) internal successors, (559), 447 states have internal predecessors, (559), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:53:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 679 transitions. [2025-02-06 03:53:46,551 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 679 transitions. Word has length 148 [2025-02-06 03:53:46,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:46,551 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 679 transitions. [2025-02-06 03:53:46,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:53:46,552 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 679 transitions. [2025-02-06 03:53:46,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 03:53:46,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:46,553 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:46,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:53:46,554 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:46,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:46,554 INFO L85 PathProgramCache]: Analyzing trace with hash -925827982, now seen corresponding path program 1 times [2025-02-06 03:53:46,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:53:46,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923929986] [2025-02-06 03:53:46,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:46,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:53:46,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 03:53:46,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 03:53:46,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:46,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:46,738 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:53:46,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:53:46,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923929986] [2025-02-06 03:53:46,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923929986] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:53:46,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943887935] [2025-02-06 03:53:46,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:46,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:53:46,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:53:46,740 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:53:46,741 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:53:46,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 03:53:47,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 03:53:47,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:47,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:47,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:53:47,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:53:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:53:47,064 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:53:47,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943887935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:47,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:53:47,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2025-02-06 03:53:47,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037110704] [2025-02-06 03:53:47,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:47,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:53:47,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:53:47,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:53:47,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:53:47,067 INFO L87 Difference]: Start difference. First operand 514 states and 679 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:53:47,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:47,131 INFO L93 Difference]: Finished difference Result 1061 states and 1397 transitions. [2025-02-06 03:53:47,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:53:47,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2025-02-06 03:53:47,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:47,135 INFO L225 Difference]: With dead ends: 1061 [2025-02-06 03:53:47,135 INFO L226 Difference]: Without dead ends: 550 [2025-02-06 03:53:47,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:53:47,137 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:47,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 865 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:53:47,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-02-06 03:53:47,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 520. [2025-02-06 03:53:47,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 449 states have (on average 1.2583518930957684) internal successors, (565), 453 states have internal predecessors, (565), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:53:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 685 transitions. [2025-02-06 03:53:47,172 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 685 transitions. Word has length 149 [2025-02-06 03:53:47,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:47,173 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 685 transitions. [2025-02-06 03:53:47,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:53:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 685 transitions. [2025-02-06 03:53:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 03:53:47,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:47,175 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:47,185 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:53:47,376 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,SelfDestructingSolverStorable16 [2025-02-06 03:53:47,376 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:47,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:47,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1322464244, now seen corresponding path program 1 times [2025-02-06 03:53:47,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:53:47,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242049763] [2025-02-06 03:53:47,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:47,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:53:47,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 03:53:47,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 03:53:47,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:47,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:53:48,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:53:48,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242049763] [2025-02-06 03:53:48,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242049763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:48,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:48,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:53:48,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018961981] [2025-02-06 03:53:48,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:48,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:53:48,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:53:48,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:53:48,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:53:48,673 INFO L87 Difference]: Start difference. First operand 520 states and 685 transitions. Second operand has 8 states, 5 states have (on average 12.4) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:53:49,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:49,360 INFO L93 Difference]: Finished difference Result 1219 states and 1596 transitions. [2025-02-06 03:53:49,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:53:49,361 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 12.4) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 149 [2025-02-06 03:53:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:49,365 INFO L225 Difference]: With dead ends: 1219 [2025-02-06 03:53:49,365 INFO L226 Difference]: Without dead ends: 702 [2025-02-06 03:53:49,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:53:49,367 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 54 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:49,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 627 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:53:49,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-02-06 03:53:49,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 586. [2025-02-06 03:53:49,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 513 states have (on average 1.2612085769980508) internal successors, (647), 517 states have internal predecessors, (647), 60 states have call successors, (60), 12 states have call predecessors, (60), 12 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:53:49,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 767 transitions. [2025-02-06 03:53:49,405 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 767 transitions. Word has length 149 [2025-02-06 03:53:49,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:49,405 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 767 transitions. [2025-02-06 03:53:49,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 12.4) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:53:49,406 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 767 transitions. [2025-02-06 03:53:49,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 03:53:49,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:49,407 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:49,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 03:53:49,408 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:49,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:49,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1843352519, now seen corresponding path program 1 times [2025-02-06 03:53:49,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:53:49,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269901711] [2025-02-06 03:53:49,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:49,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:53:49,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 03:53:49,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 03:53:49,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:49,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:53:50,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:53:50,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269901711] [2025-02-06 03:53:50,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269901711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:50,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:50,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:53:50,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469123764] [2025-02-06 03:53:50,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:50,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:53:50,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:53:50,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:53:50,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:53:50,859 INFO L87 Difference]: Start difference. First operand 586 states and 767 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:53:51,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:51,404 INFO L93 Difference]: Finished difference Result 1145 states and 1488 transitions. [2025-02-06 03:53:51,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:53:51,404 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 149 [2025-02-06 03:53:51,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:51,409 INFO L225 Difference]: With dead ends: 1145 [2025-02-06 03:53:51,409 INFO L226 Difference]: Without dead ends: 1143 [2025-02-06 03:53:51,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:53:51,410 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 88 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:51,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 897 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:53:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2025-02-06 03:53:51,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 829. [2025-02-06 03:53:51,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 756 states have (on average 1.2671957671957672) internal successors, (958), 760 states have internal predecessors, (958), 60 states have call successors, (60), 12 states have call predecessors, (60), 12 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:53:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1078 transitions. [2025-02-06 03:53:51,463 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1078 transitions. Word has length 149 [2025-02-06 03:53:51,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:51,464 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1078 transitions. [2025-02-06 03:53:51,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:53:51,464 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1078 transitions. [2025-02-06 03:53:51,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:53:51,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:51,466 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:51,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:53:51,466 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:51,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:51,467 INFO L85 PathProgramCache]: Analyzing trace with hash -169226615, now seen corresponding path program 1 times [2025-02-06 03:53:51,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:53:51,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690386182] [2025-02-06 03:53:51,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:51,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:53:51,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:53:51,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:53:51,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:51,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:53:53,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:53:53,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690386182] [2025-02-06 03:53:53,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690386182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:53,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:53,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-06 03:53:53,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983030283] [2025-02-06 03:53:53,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:53,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 03:53:53,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:53:53,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 03:53:53,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:53:53,348 INFO L87 Difference]: Start difference. First operand 829 states and 1078 transitions. Second operand has 18 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:53:54,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:54,955 INFO L93 Difference]: Finished difference Result 1586 states and 2062 transitions. [2025-02-06 03:53:54,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 03:53:54,955 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 151 [2025-02-06 03:53:54,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:54,959 INFO L225 Difference]: With dead ends: 1586 [2025-02-06 03:53:54,959 INFO L226 Difference]: Without dead ends: 1048 [2025-02-06 03:53:54,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2025-02-06 03:53:54,961 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 214 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 1729 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1826 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:54,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1826 Invalid, 1750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1729 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 03:53:54,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2025-02-06 03:53:55,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 975. [2025-02-06 03:53:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 872 states have (on average 1.2660550458715596) internal successors, (1104), 878 states have internal predecessors, (1104), 84 states have call successors, (84), 18 states have call predecessors, (84), 18 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 03:53:55,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1272 transitions. [2025-02-06 03:53:55,032 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1272 transitions. Word has length 151 [2025-02-06 03:53:55,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:55,032 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1272 transitions. [2025-02-06 03:53:55,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:53:55,033 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1272 transitions. [2025-02-06 03:53:55,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:53:55,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:55,034 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:55,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 03:53:55,035 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:55,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:55,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1794904344, now seen corresponding path program 1 times [2025-02-06 03:53:55,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:53:55,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836030666] [2025-02-06 03:53:55,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:55,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:53:55,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:53:55,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:53:55,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:55,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:53:56,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:53:56,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836030666] [2025-02-06 03:53:56,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836030666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:56,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:56,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 03:53:56,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509346995] [2025-02-06 03:53:56,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:56,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:53:56,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:53:56,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:53:56,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:53:56,652 INFO L87 Difference]: Start difference. First operand 975 states and 1272 transitions. Second operand has 12 states, 10 states have (on average 6.4) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:53:57,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:57,548 INFO L93 Difference]: Finished difference Result 2016 states and 2626 transitions. [2025-02-06 03:53:57,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:53:57,549 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.4) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 151 [2025-02-06 03:53:57,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:57,553 INFO L225 Difference]: With dead ends: 2016 [2025-02-06 03:53:57,554 INFO L226 Difference]: Without dead ends: 1044 [2025-02-06 03:53:57,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:53:57,556 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 166 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:57,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 600 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:53:57,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2025-02-06 03:53:57,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 983. [2025-02-06 03:53:57,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 880 states have (on average 1.2704545454545455) internal successors, (1118), 886 states have internal predecessors, (1118), 84 states have call successors, (84), 18 states have call predecessors, (84), 18 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 03:53:57,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1286 transitions. [2025-02-06 03:53:57,620 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1286 transitions. Word has length 151 [2025-02-06 03:53:57,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:57,620 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1286 transitions. [2025-02-06 03:53:57,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.4) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:53:57,621 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1286 transitions. [2025-02-06 03:53:57,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:53:57,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:57,622 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:57,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 03:53:57,622 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:57,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:57,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1226171100, now seen corresponding path program 1 times [2025-02-06 03:53:57,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:53:57,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639587641] [2025-02-06 03:53:57,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:57,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:53:57,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:53:57,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:53:57,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:57,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:58,978 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:53:58,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:53:58,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639587641] [2025-02-06 03:53:58,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639587641] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:53:58,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940964994] [2025-02-06 03:53:58,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:58,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:53:58,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:53:58,981 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:53:58,982 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:53:59,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:53:59,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:53:59,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:59,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:59,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-06 03:53:59,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:53:59,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 25 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 43 [2025-02-06 03:53:59,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:59,579 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 58 treesize of output 61 [2025-02-06 03:53:59,768 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 0 case distinctions, treesize of input 58 treesize of output 61 [2025-02-06 03:54:00,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:00,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 76 treesize of output 78 [2025-02-06 03:54:00,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:00,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 76 treesize of output 78 [2025-02-06 03:54:00,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:00,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 76 treesize of output 78 [2025-02-06 03:54:00,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:00,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 76 treesize of output 78 [2025-02-06 03:54:01,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:01,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 76 treesize of output 71 [2025-02-06 03:54:01,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:01,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 69 treesize of output 61 [2025-02-06 03:54:01,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:01,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 10 case distinctions, treesize of input 62 treesize of output 51 [2025-02-06 03:54:01,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:01,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 41 [2025-02-06 03:54:01,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:01,889 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 48 treesize of output 38 [2025-02-06 03:54:01,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:01,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 31 [2025-02-06 03:54:01,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:01,984 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 50 treesize of output 46 [2025-02-06 03:54:02,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:02,072 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 78 treesize of output 73 [2025-02-06 03:54:02,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:02,231 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 63 treesize of output 27 [2025-02-06 03:54:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 78 proven. 452 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-06 03:54:02,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:54:02,877 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 84 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-02-06 03:54:02,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940964994] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:54:02,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:54:02,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 9] total 36 [2025-02-06 03:54:02,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377648844] [2025-02-06 03:54:02,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:54:02,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-06 03:54:02,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:02,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 03:54:02,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 03:54:02,879 INFO L87 Difference]: Start difference. First operand 983 states and 1286 transitions. Second operand has 36 states, 31 states have (on average 6.0) internal successors, (186), 35 states have internal predecessors, (186), 15 states have call successors, (54), 8 states have call predecessors, (54), 11 states have return successors, (54), 11 states have call predecessors, (54), 15 states have call successors, (54) [2025-02-06 03:54:08,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:54:10,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:10,532 INFO L93 Difference]: Finished difference Result 2647 states and 3411 transitions. [2025-02-06 03:54:10,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-02-06 03:54:10,536 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 31 states have (on average 6.0) internal successors, (186), 35 states have internal predecessors, (186), 15 states have call successors, (54), 8 states have call predecessors, (54), 11 states have return successors, (54), 11 states have call predecessors, (54), 15 states have call successors, (54) Word has length 151 [2025-02-06 03:54:10,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:10,542 INFO L225 Difference]: With dead ends: 2647 [2025-02-06 03:54:10,542 INFO L226 Difference]: Without dead ends: 1667 [2025-02-06 03:54:10,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1671 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=932, Invalid=4920, Unknown=0, NotChecked=0, Total=5852 [2025-02-06 03:54:10,548 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 1055 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 273 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1064 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 2604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:10,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1064 Valid, 1126 Invalid, 2604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 2330 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2025-02-06 03:54:10,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2025-02-06 03:54:10,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1231. [2025-02-06 03:54:10,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1091 states have (on average 1.2584784601283225) internal successors, (1373), 1100 states have internal predecessors, (1373), 106 states have call successors, (106), 33 states have call predecessors, (106), 33 states have return successors, (106), 97 states have call predecessors, (106), 106 states have call successors, (106) [2025-02-06 03:54:10,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1585 transitions. [2025-02-06 03:54:10,648 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1585 transitions. Word has length 151 [2025-02-06 03:54:10,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:10,648 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1585 transitions. [2025-02-06 03:54:10,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 31 states have (on average 6.0) internal successors, (186), 35 states have internal predecessors, (186), 15 states have call successors, (54), 8 states have call predecessors, (54), 11 states have return successors, (54), 11 states have call predecessors, (54), 15 states have call successors, (54) [2025-02-06 03:54:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1585 transitions. [2025-02-06 03:54:10,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:54:10,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:10,650 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:10,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 03:54:10,851 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,SelfDestructingSolverStorable21 [2025-02-06 03:54:10,851 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:10,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:10,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1071004698, now seen corresponding path program 1 times [2025-02-06 03:54:10,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:10,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739382412] [2025-02-06 03:54:10,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:10,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:10,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:54:10,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:54:10,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:10,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:54:12,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:12,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739382412] [2025-02-06 03:54:12,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739382412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:12,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:12,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 03:54:12,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480259899] [2025-02-06 03:54:12,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:12,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:54:12,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:12,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:54:12,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:54:12,366 INFO L87 Difference]: Start difference. First operand 1231 states and 1585 transitions. Second operand has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:54:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:13,511 INFO L93 Difference]: Finished difference Result 2416 states and 3116 transitions. [2025-02-06 03:54:13,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:54:13,512 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 151 [2025-02-06 03:54:13,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:13,518 INFO L225 Difference]: With dead ends: 2416 [2025-02-06 03:54:13,518 INFO L226 Difference]: Without dead ends: 1271 [2025-02-06 03:54:13,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:54:13,521 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 212 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:13,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 697 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 03:54:13,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2025-02-06 03:54:13,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1234. [2025-02-06 03:54:13,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1094 states have (on average 1.2586837294332724) internal successors, (1377), 1103 states have internal predecessors, (1377), 106 states have call successors, (106), 33 states have call predecessors, (106), 33 states have return successors, (106), 97 states have call predecessors, (106), 106 states have call successors, (106) [2025-02-06 03:54:13,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1589 transitions. [2025-02-06 03:54:13,608 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1589 transitions. Word has length 151 [2025-02-06 03:54:13,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:13,609 INFO L471 AbstractCegarLoop]: Abstraction has 1234 states and 1589 transitions. [2025-02-06 03:54:13,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:54:13,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1589 transitions. [2025-02-06 03:54:13,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:54:13,610 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:13,611 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:13,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 03:54:13,611 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:13,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:13,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1950070746, now seen corresponding path program 1 times [2025-02-06 03:54:13,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:13,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075579650] [2025-02-06 03:54:13,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:13,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:13,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:54:13,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:54:13,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:13,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:54:14,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:14,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075579650] [2025-02-06 03:54:14,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075579650] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:54:14,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127675560] [2025-02-06 03:54:14,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:14,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:14,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:54:14,917 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:54:14,918 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:54:15,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:54:15,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:54:15,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:15,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:15,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-06 03:54:15,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:54:15,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 18 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2025-02-06 03:54:15,511 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 0 case distinctions, treesize of input 44 treesize of output 41