./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 db4292ffbdd6738d463d7123be4385279117f56fc7d42e6eafbd16b6955555da --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:52:53,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:52:53,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:52:53,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:52:53,085 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:52:53,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:52:53,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:52:53,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:52:53,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:52:53,105 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:52:53,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:52:53,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:52:53,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:52:53,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:52:53,107 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:52:53,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:52:53,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:52:53,107 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:52:53,107 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:52:53,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:52:53,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:52:53,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:52:53,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:52:53,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:52:53,108 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:52:53,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:52:53,108 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:52:53,108 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:52:53,108 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:52:53,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:52:53,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:52:53,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:52:53,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:52:53,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:52:53,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:52:53,109 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:52:53,109 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:52:53,109 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:52:53,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:52:53,109 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:52:53,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:52:53,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:52:53,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:52:53,110 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/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 -> db4292ffbdd6738d463d7123be4385279117f56fc7d42e6eafbd16b6955555da [2025-03-04 01:52:53,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:52:53,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:52:53,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:52:53,330 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:52:53,331 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:52:53,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-6.i [2025-03-04 01:52:54,452 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8274a58ff/f3e3c3fb3ee54cd48cff0fd66f2340f3/FLAG878857bed [2025-03-04 01:52:54,680 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:52:54,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-6.i [2025-03-04 01:52:54,686 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8274a58ff/f3e3c3fb3ee54cd48cff0fd66f2340f3/FLAG878857bed [2025-03-04 01:52:55,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8274a58ff/f3e3c3fb3ee54cd48cff0fd66f2340f3 [2025-03-04 01:52:55,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:52:55,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:52:55,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:52:55,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:52:55,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:52:55,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:52:55" (1/1) ... [2025-03-04 01:52:55,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62d98f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:55, skipping insertion in model container [2025-03-04 01:52:55,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:52:55" (1/1) ... [2025-03-04 01:52:55,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:52:55,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-6.i[916,929] [2025-03-04 01:52:55,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:52:55,195 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:52:55,202 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-6.i[916,929] [2025-03-04 01:52:55,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:52:55,253 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:52:55,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:55 WrapperNode [2025-03-04 01:52:55,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:52:55,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:52:55,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:52:55,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:52:55,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:55" (1/1) ... [2025-03-04 01:52:55,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:55" (1/1) ... [2025-03-04 01:52:55,292 INFO L138 Inliner]: procedures = 30, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 524 [2025-03-04 01:52:55,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:52:55,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:52:55,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:52:55,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:52:55,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:55" (1/1) ... [2025-03-04 01:52:55,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:55" (1/1) ... [2025-03-04 01:52:55,302 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:55" (1/1) ... [2025-03-04 01:52:55,310 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:52:55,310 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:55" (1/1) ... [2025-03-04 01:52:55,310 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:55" (1/1) ... [2025-03-04 01:52:55,322 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:55" (1/1) ... [2025-03-04 01:52:55,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:55" (1/1) ... [2025-03-04 01:52:55,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:55" (1/1) ... [2025-03-04 01:52:55,326 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:55" (1/1) ... [2025-03-04 01:52:55,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:52:55,329 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:52:55,329 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:52:55,329 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:52:55,330 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:55" (1/1) ... [2025-03-04 01:52:55,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:52:55,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:52:55,355 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:52:55,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:52:55,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:52:55,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:52:55,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:52:55,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:52:55,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:52:55,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:52:55,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:52:55,376 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:52:55,376 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:52:55,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:52:55,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:52:55,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:52:55,481 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:52:55,483 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:52:56,005 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L143: havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite106#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~ite105#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem107#1;havoc property_#t~ite118#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~short119#1;havoc property_#t~ite124#1;havoc property_#t~mem123#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~short122#1;havoc property_#t~short125#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite135#1;havoc property_#t~mem134#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem133#1;havoc property_#t~short136#1;havoc property_#t~mem142#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~ite141#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~short143#1; [2025-03-04 01:52:56,055 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2025-03-04 01:52:56,056 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:52:56,063 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:52:56,063 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:52:56,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:52:56 BoogieIcfgContainer [2025-03-04 01:52:56,063 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:52:56,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:52:56,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:52:56,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:52:56,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:52:55" (1/3) ... [2025-03-04 01:52:56,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f2942b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:52:56, skipping insertion in model container [2025-03-04 01:52:56,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:55" (2/3) ... [2025-03-04 01:52:56,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f2942b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:52:56, skipping insertion in model container [2025-03-04 01:52:56,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:52:56" (3/3) ... [2025-03-04 01:52:56,070 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-6.i [2025-03-04 01:52:56,080 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:52:56,081 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-6.i that has 2 procedures, 121 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:52:56,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:52:56,131 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;@262be7d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:52:56,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:52:56,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 99 states have (on average 1.404040404040404) internal successors, (139), 100 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:52:56,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:52:56,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:56,146 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:52:56,146 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:56,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:56,151 INFO L85 PathProgramCache]: Analyzing trace with hash -321134822, now seen corresponding path program 1 times [2025-03-04 01:52:56,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:56,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088695585] [2025-03-04 01:52:56,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:56,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:56,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:52:56,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:52:56,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:56,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:56,454 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 01:52:56,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:56,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088695585] [2025-03-04 01:52:56,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088695585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:52:56,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197330008] [2025-03-04 01:52:56,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:56,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:52:56,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:52:56,463 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:52:56,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:52:56,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:52:56,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:52:56,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:56,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:56,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:52:56,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:52:56,700 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 01:52:56,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:52:56,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197330008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:56,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:52:56,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:52:56,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645053561] [2025-03-04 01:52:56,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:56,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:52:56,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:56,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:52:56,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:52:56,719 INFO L87 Difference]: Start difference. First operand has 121 states, 99 states have (on average 1.404040404040404) internal successors, (139), 100 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:52:56,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:56,737 INFO L93 Difference]: Finished difference Result 236 states and 368 transitions. [2025-03-04 01:52:56,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:52:56,738 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 158 [2025-03-04 01:52:56,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:56,742 INFO L225 Difference]: With dead ends: 236 [2025-03-04 01:52:56,742 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 01:52:56,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 159 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-03-04 01:52:56,745 INFO L435 NwaCegarLoop]: 172 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, 172 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-03-04 01:52:56,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:52:56,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 01:52:56,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-04 01:52:56,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 97 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:52:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2025-03-04 01:52:56,777 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 158 [2025-03-04 01:52:56,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:56,777 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2025-03-04 01:52:56,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:52:56,778 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2025-03-04 01:52:56,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:52:56,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:56,780 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:52:56,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:52:56,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:52:56,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:56,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:56,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2076039913, now seen corresponding path program 1 times [2025-03-04 01:52:56,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:56,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007695306] [2025-03-04 01:52:56,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:56,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:57,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:52:57,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:52:57,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:57,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:52:57,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:57,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007695306] [2025-03-04 01:52:57,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007695306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:57,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:52:57,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:52:57,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361387992] [2025-03-04 01:52:57,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:57,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:52:57,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:57,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:52:57,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:52:57,379 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:52:57,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:57,400 INFO L93 Difference]: Finished difference Result 233 states and 341 transitions. [2025-03-04 01:52:57,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:52:57,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2025-03-04 01:52:57,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:57,404 INFO L225 Difference]: With dead ends: 233 [2025-03-04 01:52:57,404 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 01:52:57,404 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-03-04 01:52:57,405 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:57,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 335 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:52:57,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 01:52:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-04 01:52:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:52:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 171 transitions. [2025-03-04 01:52:57,417 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 171 transitions. Word has length 158 [2025-03-04 01:52:57,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:57,418 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 171 transitions. [2025-03-04 01:52:57,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:52:57,419 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 171 transitions. [2025-03-04 01:52:57,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:52:57,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:57,421 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:52:57,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:52:57,421 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:57,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:57,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1231568042, now seen corresponding path program 1 times [2025-03-04 01:52:57,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:57,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961364156] [2025-03-04 01:52:57,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:57,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:57,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:52:57,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:52:57,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:57,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:52:57,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:57,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961364156] [2025-03-04 01:52:57,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961364156] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:52:57,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017706240] [2025-03-04 01:52:57,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:57,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:52:57,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:52:57,716 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:52:57,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:52:57,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:52:57,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:52:57,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:57,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:57,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:52:57,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:52:58,010 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:52:58,010 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:52:58,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017706240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:58,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:52:58,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:52:58,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377569533] [2025-03-04 01:52:58,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:58,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:52:58,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:58,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:52:58,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:52:58,012 INFO L87 Difference]: Start difference. First operand 118 states and 171 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:52:58,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:58,049 INFO L93 Difference]: Finished difference Result 235 states and 342 transitions. [2025-03-04 01:52:58,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:52:58,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2025-03-04 01:52:58,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:58,050 INFO L225 Difference]: With dead ends: 235 [2025-03-04 01:52:58,050 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 01:52:58,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:52:58,051 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:58,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 496 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:52:58,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 01:52:58,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-04 01:52:58,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:52:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 173 transitions. [2025-03-04 01:52:58,065 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 173 transitions. Word has length 158 [2025-03-04 01:52:58,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:58,067 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 173 transitions. [2025-03-04 01:52:58,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:52:58,067 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 173 transitions. [2025-03-04 01:52:58,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:52:58,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:58,072 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:52:58,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 01:52:58,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 01:52:58,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:58,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:58,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1794605337, now seen corresponding path program 1 times [2025-03-04 01:52:58,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:58,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861784333] [2025-03-04 01:52:58,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:58,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:58,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:52:58,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:52:58,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:58,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:52:58,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:58,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861784333] [2025-03-04 01:52:58,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861784333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:58,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:52:58,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:52:58,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158493568] [2025-03-04 01:52:58,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:58,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:52:58,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:58,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:52:58,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:52:58,523 INFO L87 Difference]: Start difference. First operand 120 states and 173 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:52:58,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:58,680 INFO L93 Difference]: Finished difference Result 237 states and 343 transitions. [2025-03-04 01:52:58,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:52:58,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2025-03-04 01:52:58,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:58,682 INFO L225 Difference]: With dead ends: 237 [2025-03-04 01:52:58,684 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 01:52:58,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:52:58,685 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:58,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 444 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:52:58,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 01:52:58,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-04 01:52:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:52:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 172 transitions. [2025-03-04 01:52:58,692 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 172 transitions. Word has length 160 [2025-03-04 01:52:58,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:58,692 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 172 transitions. [2025-03-04 01:52:58,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:52:58,692 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 172 transitions. [2025-03-04 01:52:58,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:52:58,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:58,694 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:52:58,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:52:58,694 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:58,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:58,694 INFO L85 PathProgramCache]: Analyzing trace with hash -441295640, now seen corresponding path program 1 times [2025-03-04 01:52:58,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:58,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444261148] [2025-03-04 01:52:58,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:58,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:58,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:52:59,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:52:59,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:59,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 63 proven. 81 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-03-04 01:53:01,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:01,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444261148] [2025-03-04 01:53:01,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444261148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:53:01,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689719563] [2025-03-04 01:53:01,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:01,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:53:01,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:53:01,756 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:53:01,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:53:01,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:53:02,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:53:02,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:02,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:02,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-04 01:53:02,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:53:02,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 1 [2025-03-04 01:53:02,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:53:02,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:53:03,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:53:03,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:53:03,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:53:03,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:53:04,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:53:04,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:53:04,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:53:04,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:53:04,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:53:05,150 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-04 01:53:05,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2025-03-04 01:53:05,300 INFO L349 Elim1Store]: treesize reduction 45, result has 25.0 percent of original size [2025-03-04 01:53:05,300 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 36 treesize of output 38 [2025-03-04 01:53:05,845 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-03-04 01:53:05,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:53:06,900 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:06,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689719563] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:53:06,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:53:06,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15, 10] total 30 [2025-03-04 01:53:06,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274786798] [2025-03-04 01:53:06,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:06,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:53:06,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:06,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:53:06,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2025-03-04 01:53:06,902 INFO L87 Difference]: Start difference. First operand 120 states and 172 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:08,996 INFO L93 Difference]: Finished difference Result 271 states and 386 transitions. [2025-03-04 01:53:08,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:53:08,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2025-03-04 01:53:08,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:08,998 INFO L225 Difference]: With dead ends: 271 [2025-03-04 01:53:08,998 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 01:53:08,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=136, Invalid=986, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 01:53:08,999 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 46 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:08,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 849 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 01:53:09,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 01:53:09,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 124. [2025-03-04 01:53:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:53:09,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions. [2025-03-04 01:53:09,010 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 160 [2025-03-04 01:53:09,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:09,011 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions. [2025-03-04 01:53:09,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:09,011 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions. [2025-03-04 01:53:09,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:53:09,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:09,012 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:53:09,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 01:53:09,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:53:09,212 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:09,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:09,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1525316763, now seen corresponding path program 1 times [2025-03-04 01:53:09,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:09,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324564374] [2025-03-04 01:53:09,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:09,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:09,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:53:09,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:53:09,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:09,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:10,710 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:10,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:10,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324564374] [2025-03-04 01:53:10,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324564374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:10,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:10,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:53:10,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948918556] [2025-03-04 01:53:10,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:10,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:53:10,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:10,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:53:10,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:53:10,712 INFO L87 Difference]: Start difference. First operand 124 states and 176 transitions. Second operand has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:53:11,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:11,810 INFO L93 Difference]: Finished difference Result 296 states and 418 transitions. [2025-03-04 01:53:11,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:53:11,811 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 160 [2025-03-04 01:53:11,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:11,812 INFO L225 Difference]: With dead ends: 296 [2025-03-04 01:53:11,812 INFO L226 Difference]: Without dead ends: 175 [2025-03-04 01:53:11,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:53:11,813 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 352 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:11,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 712 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:53:11,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-04 01:53:11,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 143. [2025-03-04 01:53:11,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 122 states have internal predecessors, (162), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:53:11,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 200 transitions. [2025-03-04 01:53:11,826 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 200 transitions. Word has length 160 [2025-03-04 01:53:11,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:11,826 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 200 transitions. [2025-03-04 01:53:11,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:53:11,827 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 200 transitions. [2025-03-04 01:53:11,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 01:53:11,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:11,828 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:53:11,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:53:11,828 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:11,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:11,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1108936630, now seen corresponding path program 1 times [2025-03-04 01:53:11,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:11,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657925727] [2025-03-04 01:53:11,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:11,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 01:53:11,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 01:53:11,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:11,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:13,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:13,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657925727] [2025-03-04 01:53:13,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657925727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:13,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:13,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:53:13,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611521707] [2025-03-04 01:53:13,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:13,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:53:13,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:13,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:53:13,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:53:13,646 INFO L87 Difference]: Start difference. First operand 143 states and 200 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:53:14,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:14,868 INFO L93 Difference]: Finished difference Result 426 states and 599 transitions. [2025-03-04 01:53:14,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:53:14,868 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 161 [2025-03-04 01:53:14,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:14,870 INFO L225 Difference]: With dead ends: 426 [2025-03-04 01:53:14,870 INFO L226 Difference]: Without dead ends: 286 [2025-03-04 01:53:14,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:53:14,871 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 235 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:14,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 981 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:53:14,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-04 01:53:14,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 229. [2025-03-04 01:53:14,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 188 states have (on average 1.3297872340425532) internal successors, (250), 188 states have internal predecessors, (250), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:53:14,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 326 transitions. [2025-03-04 01:53:14,886 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 326 transitions. Word has length 161 [2025-03-04 01:53:14,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:14,886 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 326 transitions. [2025-03-04 01:53:14,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:53:14,886 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 326 transitions. [2025-03-04 01:53:14,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 01:53:14,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:14,887 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:53:14,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:53:14,888 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:14,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:14,888 INFO L85 PathProgramCache]: Analyzing trace with hash 264464759, now seen corresponding path program 1 times [2025-03-04 01:53:14,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:14,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408057150] [2025-03-04 01:53:14,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:14,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:14,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 01:53:14,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 01:53:14,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:14,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:15,210 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:15,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:15,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408057150] [2025-03-04 01:53:15,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408057150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:15,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:15,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:53:15,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621268901] [2025-03-04 01:53:15,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:15,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:53:15,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:15,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:53:15,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:53:15,213 INFO L87 Difference]: Start difference. First operand 229 states and 326 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:15,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:15,426 INFO L93 Difference]: Finished difference Result 410 states and 578 transitions. [2025-03-04 01:53:15,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:53:15,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2025-03-04 01:53:15,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:15,428 INFO L225 Difference]: With dead ends: 410 [2025-03-04 01:53:15,428 INFO L226 Difference]: Without dead ends: 270 [2025-03-04 01:53:15,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:53:15,429 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 47 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:15,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 767 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:53:15,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-04 01:53:15,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 235. [2025-03-04 01:53:15,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 194 states have (on average 1.3298969072164948) internal successors, (258), 194 states have internal predecessors, (258), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:53:15,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 334 transitions. [2025-03-04 01:53:15,450 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 334 transitions. Word has length 161 [2025-03-04 01:53:15,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:15,450 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 334 transitions. [2025-03-04 01:53:15,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:15,451 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 334 transitions. [2025-03-04 01:53:15,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 01:53:15,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:15,452 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:53:15,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:53:15,452 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:15,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:15,453 INFO L85 PathProgramCache]: Analyzing trace with hash 770023384, now seen corresponding path program 1 times [2025-03-04 01:53:15,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:15,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625037584] [2025-03-04 01:53:15,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:15,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:15,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 01:53:15,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 01:53:15,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:15,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:17,496 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:17,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:17,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625037584] [2025-03-04 01:53:17,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625037584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:17,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:17,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 01:53:17,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351416697] [2025-03-04 01:53:17,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:17,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:53:17,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:17,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:53:17,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:53:17,497 INFO L87 Difference]: Start difference. First operand 235 states and 334 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:53:19,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:19,409 INFO L93 Difference]: Finished difference Result 445 states and 623 transitions. [2025-03-04 01:53:19,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:53:19,410 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 161 [2025-03-04 01:53:19,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:19,413 INFO L225 Difference]: With dead ends: 445 [2025-03-04 01:53:19,413 INFO L226 Difference]: Without dead ends: 299 [2025-03-04 01:53:19,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2025-03-04 01:53:19,414 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 376 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:19,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 889 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 01:53:19,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-04 01:53:19,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 240. [2025-03-04 01:53:19,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 199 states have (on average 1.3266331658291457) internal successors, (264), 199 states have internal predecessors, (264), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:53:19,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 340 transitions. [2025-03-04 01:53:19,432 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 340 transitions. Word has length 161 [2025-03-04 01:53:19,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:19,437 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 340 transitions. [2025-03-04 01:53:19,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:53:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 340 transitions. [2025-03-04 01:53:19,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 01:53:19,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:19,438 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:53:19,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:53:19,438 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:19,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:19,439 INFO L85 PathProgramCache]: Analyzing trace with hash -819556364, now seen corresponding path program 1 times [2025-03-04 01:53:19,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:19,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218195231] [2025-03-04 01:53:19,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:19,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:19,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 01:53:19,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 01:53:19,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:19,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:20,781 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:20,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:20,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218195231] [2025-03-04 01:53:20,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218195231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:20,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:20,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:53:20,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696049961] [2025-03-04 01:53:20,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:20,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:53:20,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:20,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:53:20,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:53:20,783 INFO L87 Difference]: Start difference. First operand 240 states and 340 transitions. Second operand has 11 states, 9 states have (on average 7.666666666666667) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:53:21,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:21,721 INFO L93 Difference]: Finished difference Result 444 states and 623 transitions. [2025-03-04 01:53:21,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:53:21,721 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.666666666666667) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 161 [2025-03-04 01:53:21,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:21,723 INFO L225 Difference]: With dead ends: 444 [2025-03-04 01:53:21,723 INFO L226 Difference]: Without dead ends: 298 [2025-03-04 01:53:21,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:53:21,724 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 220 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:21,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 709 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:53:21,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-04 01:53:21,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 261. [2025-03-04 01:53:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 220 states have (on average 1.3272727272727274) internal successors, (292), 220 states have internal predecessors, (292), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:53:21,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 368 transitions. [2025-03-04 01:53:21,741 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 368 transitions. Word has length 161 [2025-03-04 01:53:21,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:21,741 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 368 transitions. [2025-03-04 01:53:21,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.666666666666667) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:53:21,741 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 368 transitions. [2025-03-04 01:53:21,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 01:53:21,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:21,742 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:53:21,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:53:21,743 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:21,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash 148749173, now seen corresponding path program 1 times [2025-03-04 01:53:21,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:21,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207505707] [2025-03-04 01:53:21,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:21,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:21,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 01:53:21,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 01:53:21,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:21,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:23,618 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:23,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:23,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207505707] [2025-03-04 01:53:23,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207505707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:23,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:23,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:53:23,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149056028] [2025-03-04 01:53:23,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:23,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:53:23,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:23,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:53:23,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:53:23,619 INFO L87 Difference]: Start difference. First operand 261 states and 368 transitions. Second operand has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:53:24,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:24,844 INFO L93 Difference]: Finished difference Result 539 states and 750 transitions. [2025-03-04 01:53:24,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:53:24,844 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 161 [2025-03-04 01:53:24,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:24,846 INFO L225 Difference]: With dead ends: 539 [2025-03-04 01:53:24,846 INFO L226 Difference]: Without dead ends: 378 [2025-03-04 01:53:24,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:53:24,848 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 353 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:24,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 776 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:53:24,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-04 01:53:24,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 268. [2025-03-04 01:53:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 227 states have (on average 1.3171806167400881) internal successors, (299), 227 states have internal predecessors, (299), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:53:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 375 transitions. [2025-03-04 01:53:24,881 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 375 transitions. Word has length 161 [2025-03-04 01:53:24,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:24,881 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 375 transitions. [2025-03-04 01:53:24,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:53:24,882 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 375 transitions. [2025-03-04 01:53:24,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 01:53:24,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:24,887 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:53:24,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:53:24,887 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:24,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:24,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1605143399, now seen corresponding path program 1 times [2025-03-04 01:53:24,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:24,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408485235] [2025-03-04 01:53:24,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:24,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:24,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:53:25,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:53:25,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:25,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:25,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:25,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408485235] [2025-03-04 01:53:25,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408485235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:25,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:25,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:53:25,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676254530] [2025-03-04 01:53:25,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:25,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:53:25,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:25,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:53:25,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:53:25,325 INFO L87 Difference]: Start difference. First operand 268 states and 375 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:25,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:25,545 INFO L93 Difference]: Finished difference Result 431 states and 604 transitions. [2025-03-04 01:53:25,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:53:25,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 162 [2025-03-04 01:53:25,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:25,548 INFO L225 Difference]: With dead ends: 431 [2025-03-04 01:53:25,548 INFO L226 Difference]: Without dead ends: 270 [2025-03-04 01:53:25,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:53:25,550 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 134 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:25,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 370 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:53:25,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-04 01:53:25,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 268. [2025-03-04 01:53:25,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 227 states have (on average 1.3083700440528634) internal successors, (297), 227 states have internal predecessors, (297), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:53:25,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 373 transitions. [2025-03-04 01:53:25,567 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 373 transitions. Word has length 162 [2025-03-04 01:53:25,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:25,568 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 373 transitions. [2025-03-04 01:53:25,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:25,568 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 373 transitions. [2025-03-04 01:53:25,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 01:53:25,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:25,569 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:53:25,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:53:25,569 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:25,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:25,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1939611645, now seen corresponding path program 1 times [2025-03-04 01:53:25,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:25,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920607161] [2025-03-04 01:53:25,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:25,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:25,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:53:25,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:53:25,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:25,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:25,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:25,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920607161] [2025-03-04 01:53:25,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920607161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:25,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:25,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:53:25,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168983801] [2025-03-04 01:53:25,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:25,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:53:25,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:25,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:53:25,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:53:25,778 INFO L87 Difference]: Start difference. First operand 268 states and 373 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:25,977 INFO L93 Difference]: Finished difference Result 503 states and 696 transitions. [2025-03-04 01:53:25,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:53:25,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 162 [2025-03-04 01:53:25,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:25,979 INFO L225 Difference]: With dead ends: 503 [2025-03-04 01:53:25,979 INFO L226 Difference]: Without dead ends: 342 [2025-03-04 01:53:25,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:53:25,980 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 143 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:25,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 393 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:53:25,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-04 01:53:25,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 316. [2025-03-04 01:53:25,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 275 states have (on average 1.2945454545454544) internal successors, (356), 275 states have internal predecessors, (356), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:53:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 432 transitions. [2025-03-04 01:53:25,996 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 432 transitions. Word has length 162 [2025-03-04 01:53:25,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:25,997 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 432 transitions. [2025-03-04 01:53:25,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:25,997 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 432 transitions. [2025-03-04 01:53:25,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 01:53:25,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:25,997 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:53:25,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:53:25,998 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:25,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:25,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1153883591, now seen corresponding path program 1 times [2025-03-04 01:53:25,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:25,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606949468] [2025-03-04 01:53:25,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:25,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:26,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:53:26,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:53:26,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:26,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:27,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:27,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606949468] [2025-03-04 01:53:27,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606949468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:27,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:27,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:53:27,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557358787] [2025-03-04 01:53:27,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:27,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:53:27,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:27,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:53:27,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:53:27,826 INFO L87 Difference]: Start difference. First operand 316 states and 432 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:53:29,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:29,363 INFO L93 Difference]: Finished difference Result 528 states and 723 transitions. [2025-03-04 01:53:29,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:53:29,364 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 162 [2025-03-04 01:53:29,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:29,366 INFO L225 Difference]: With dead ends: 528 [2025-03-04 01:53:29,366 INFO L226 Difference]: Without dead ends: 361 [2025-03-04 01:53:29,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:53:29,367 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 241 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:29,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 863 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 01:53:29,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-04 01:53:29,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 316. [2025-03-04 01:53:29,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 275 states have (on average 1.290909090909091) internal successors, (355), 275 states have internal predecessors, (355), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:53:29,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 431 transitions. [2025-03-04 01:53:29,396 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 431 transitions. Word has length 162 [2025-03-04 01:53:29,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:29,396 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 431 transitions. [2025-03-04 01:53:29,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:53:29,396 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 431 transitions. [2025-03-04 01:53:29,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 01:53:29,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:29,398 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:53:29,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:53:29,398 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:29,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:29,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1865295105, now seen corresponding path program 1 times [2025-03-04 01:53:29,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:29,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516114210] [2025-03-04 01:53:29,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:29,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:29,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:53:29,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:53:29,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:29,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:29,545 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:53:29,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:29,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516114210] [2025-03-04 01:53:29,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516114210] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:53:29,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997661751] [2025-03-04 01:53:29,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:29,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:53:29,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:53:29,547 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:53:29,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 01:53:29,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:53:29,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:53:29,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:29,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:29,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:53:29,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:53:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:29,769 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:53:29,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997661751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:29,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:53:29,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:53:29,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351433516] [2025-03-04 01:53:29,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:29,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:53:29,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:29,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:53:29,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:53:29,771 INFO L87 Difference]: Start difference. First operand 316 states and 431 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:29,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:29,801 INFO L93 Difference]: Finished difference Result 480 states and 660 transitions. [2025-03-04 01:53:29,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:53:29,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 162 [2025-03-04 01:53:29,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:29,803 INFO L225 Difference]: With dead ends: 480 [2025-03-04 01:53:29,803 INFO L226 Difference]: Without dead ends: 319 [2025-03-04 01:53:29,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 163 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-03-04 01:53:29,804 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:29,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 651 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:53:29,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-04 01:53:29,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2025-03-04 01:53:29,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 278 states have (on average 1.2877697841726619) internal successors, (358), 278 states have internal predecessors, (358), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:53:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 434 transitions. [2025-03-04 01:53:29,820 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 434 transitions. Word has length 162 [2025-03-04 01:53:29,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:29,820 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 434 transitions. [2025-03-04 01:53:29,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:29,821 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 434 transitions. [2025-03-04 01:53:29,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 01:53:29,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:29,821 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:53:29,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 01:53:30,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 01:53:30,023 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:30,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:30,023 INFO L85 PathProgramCache]: Analyzing trace with hash -463119900, now seen corresponding path program 1 times [2025-03-04 01:53:30,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:30,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854310727] [2025-03-04 01:53:30,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:30,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:30,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:53:30,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:53:30,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:30,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:31,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:31,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854310727] [2025-03-04 01:53:31,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854310727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:31,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:31,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:53:31,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105860919] [2025-03-04 01:53:31,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:31,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:53:31,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:31,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:53:31,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:53:31,820 INFO L87 Difference]: Start difference. First operand 319 states and 434 transitions. Second operand has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:53:33,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:33,567 INFO L93 Difference]: Finished difference Result 545 states and 741 transitions. [2025-03-04 01:53:33,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:53:33,567 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 162 [2025-03-04 01:53:33,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:33,569 INFO L225 Difference]: With dead ends: 545 [2025-03-04 01:53:33,569 INFO L226 Difference]: Without dead ends: 377 [2025-03-04 01:53:33,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:53:33,570 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 203 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:33,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1076 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 01:53:33,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-04 01:53:33,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 320. [2025-03-04 01:53:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 279 states have (on average 1.2867383512544803) internal successors, (359), 279 states have internal predecessors, (359), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:53:33,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 435 transitions. [2025-03-04 01:53:33,587 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 435 transitions. Word has length 162 [2025-03-04 01:53:33,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:33,587 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 435 transitions. [2025-03-04 01:53:33,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:53:33,587 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 435 transitions. [2025-03-04 01:53:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-04 01:53:33,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:33,588 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:53:33,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:53:33,588 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:33,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:33,589 INFO L85 PathProgramCache]: Analyzing trace with hash -230228105, now seen corresponding path program 1 times [2025-03-04 01:53:33,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:33,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266157687] [2025-03-04 01:53:33,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:33,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:33,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 01:53:33,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 01:53:33,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:33,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:35,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:35,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266157687] [2025-03-04 01:53:35,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266157687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:35,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:35,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:53:35,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035265066] [2025-03-04 01:53:35,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:35,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:53:35,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:35,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:53:35,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:53:35,538 INFO L87 Difference]: Start difference. First operand 320 states and 435 transitions. Second operand has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:53:36,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:36,728 INFO L93 Difference]: Finished difference Result 548 states and 744 transitions. [2025-03-04 01:53:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:53:36,729 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 163 [2025-03-04 01:53:36,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:36,731 INFO L225 Difference]: With dead ends: 548 [2025-03-04 01:53:36,731 INFO L226 Difference]: Without dead ends: 380 [2025-03-04 01:53:36,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:53:36,732 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 250 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:36,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 777 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 01:53:36,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-04 01:53:36,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 316. [2025-03-04 01:53:36,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 275 states have (on average 1.290909090909091) internal successors, (355), 275 states have internal predecessors, (355), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:53:36,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 431 transitions. [2025-03-04 01:53:36,756 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 431 transitions. Word has length 163 [2025-03-04 01:53:36,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:36,757 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 431 transitions. [2025-03-04 01:53:36,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:53:36,758 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 431 transitions. [2025-03-04 01:53:36,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-04 01:53:36,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:36,759 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:53:36,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:53:36,759 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:36,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:36,760 INFO L85 PathProgramCache]: Analyzing trace with hash -681487913, now seen corresponding path program 1 times [2025-03-04 01:53:36,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:36,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187864880] [2025-03-04 01:53:36,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:36,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:36,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 01:53:36,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 01:53:36,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:36,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:38,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:38,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187864880] [2025-03-04 01:53:38,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187864880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:38,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:38,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:53:38,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509311022] [2025-03-04 01:53:38,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:38,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:53:38,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:38,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:53:38,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:53:38,329 INFO L87 Difference]: Start difference. First operand 316 states and 431 transitions. Second operand has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 12 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:53:39,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:39,250 INFO L93 Difference]: Finished difference Result 567 states and 772 transitions. [2025-03-04 01:53:39,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:53:39,251 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 12 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 163 [2025-03-04 01:53:39,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:39,252 INFO L225 Difference]: With dead ends: 567 [2025-03-04 01:53:39,252 INFO L226 Difference]: Without dead ends: 403 [2025-03-04 01:53:39,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:53:39,253 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 184 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:39,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 916 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:53:39,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-04 01:53:39,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 352. [2025-03-04 01:53:39,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 311 states have (on average 1.2893890675241158) internal successors, (401), 311 states have internal predecessors, (401), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:53:39,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 477 transitions. [2025-03-04 01:53:39,274 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 477 transitions. Word has length 163 [2025-03-04 01:53:39,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:39,274 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 477 transitions. [2025-03-04 01:53:39,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 12 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:53:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 477 transitions. [2025-03-04 01:53:39,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-04 01:53:39,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:39,275 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:53:39,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:53:39,275 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:39,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:39,276 INFO L85 PathProgramCache]: Analyzing trace with hash -670171786, now seen corresponding path program 1 times [2025-03-04 01:53:39,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:39,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005979733] [2025-03-04 01:53:39,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:39,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:39,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 01:53:39,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 01:53:39,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:39,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:40,397 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:53:40,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:40,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005979733] [2025-03-04 01:53:40,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005979733] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:53:40,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652403000] [2025-03-04 01:53:40,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:40,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:53:40,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:53:40,400 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:53:40,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 01:53:40,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 01:53:40,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 01:53:40,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:40,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:40,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-04 01:53:40,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:53:40,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 62 [2025-03-04 01:53:40,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 83 [2025-03-04 01:53:41,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 83 [2025-03-04 01:53:41,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 83 [2025-03-04 01:53:42,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 83 [2025-03-04 01:53:42,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 83 [2025-03-04 01:53:42,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 83 [2025-03-04 01:53:42,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 83 [2025-03-04 01:53:43,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 83 [2025-03-04 01:53:43,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 92 [2025-03-04 01:53:43,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 94 [2025-03-04 01:53:44,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 96 [2025-03-04 01:53:44,718 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 1 proven. 451 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-04 01:53:44,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:53:44,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652403000] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:53:44,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:53:44,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2025-03-04 01:53:44,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746704168] [2025-03-04 01:53:44,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:53:44,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 01:53:44,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:44,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 01:53:44,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:53:44,839 INFO L87 Difference]: Start difference. First operand 352 states and 477 transitions. Second operand has 20 states, 17 states have (on average 7.823529411764706) internal successors, (133), 19 states have internal predecessors, (133), 11 states have call successors, (38), 7 states have call predecessors, (38), 8 states have return successors, (38), 8 states have call predecessors, (38), 11 states have call successors, (38) [2025-03-04 01:53:46,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:46,674 INFO L93 Difference]: Finished difference Result 580 states and 775 transitions. [2025-03-04 01:53:46,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 01:53:46,675 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 7.823529411764706) internal successors, (133), 19 states have internal predecessors, (133), 11 states have call successors, (38), 7 states have call predecessors, (38), 8 states have return successors, (38), 8 states have call predecessors, (38), 11 states have call successors, (38) Word has length 163 [2025-03-04 01:53:46,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:46,676 INFO L225 Difference]: With dead ends: 580 [2025-03-04 01:53:46,676 INFO L226 Difference]: Without dead ends: 367 [2025-03-04 01:53:46,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 200 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=283, Invalid=977, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 01:53:46,677 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 112 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:46,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 839 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 01:53:46,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-04 01:53:46,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 361. [2025-03-04 01:53:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 316 states have (on average 1.2753164556962024) internal successors, (403), 316 states have internal predecessors, (403), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:53:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 479 transitions. [2025-03-04 01:53:46,707 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 479 transitions. Word has length 163 [2025-03-04 01:53:46,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:46,707 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 479 transitions. [2025-03-04 01:53:46,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 7.823529411764706) internal successors, (133), 19 states have internal predecessors, (133), 11 states have call successors, (38), 7 states have call predecessors, (38), 8 states have return successors, (38), 8 states have call predecessors, (38), 11 states have call successors, (38) [2025-03-04 01:53:46,708 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 479 transitions. [2025-03-04 01:53:46,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 01:53:46,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:46,708 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:53:46,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 01:53:46,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:53:46,909 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:46,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:46,910 INFO L85 PathProgramCache]: Analyzing trace with hash -213496391, now seen corresponding path program 1 times [2025-03-04 01:53:46,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:46,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721586607] [2025-03-04 01:53:46,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:46,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:46,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 01:53:46,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 01:53:46,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:46,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:47,035 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:53:47,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:47,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721586607] [2025-03-04 01:53:47,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721586607] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:53:47,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711317035] [2025-03-04 01:53:47,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:47,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:53:47,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:53:47,037 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:53:47,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 01:53:47,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 01:53:47,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 01:53:47,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:47,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:47,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:53:47,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:53:47,315 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:47,316 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:53:47,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711317035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:47,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:53:47,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:53:47,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989806824] [2025-03-04 01:53:47,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:47,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:53:47,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:47,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:53:47,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:53:47,317 INFO L87 Difference]: Start difference. First operand 361 states and 479 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:47,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:47,356 INFO L93 Difference]: Finished difference Result 546 states and 735 transitions. [2025-03-04 01:53:47,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:53:47,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 164 [2025-03-04 01:53:47,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:47,358 INFO L225 Difference]: With dead ends: 546 [2025-03-04 01:53:47,358 INFO L226 Difference]: Without dead ends: 364 [2025-03-04 01:53:47,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 165 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-03-04 01:53:47,359 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 652 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-03-04 01:53:47,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 652 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:53:47,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-04 01:53:47,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2025-03-04 01:53:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 319 states have (on average 1.2727272727272727) internal successors, (406), 319 states have internal predecessors, (406), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:53:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 482 transitions. [2025-03-04 01:53:47,387 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 482 transitions. Word has length 164 [2025-03-04 01:53:47,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:47,387 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 482 transitions. [2025-03-04 01:53:47,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 482 transitions. [2025-03-04 01:53:47,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 01:53:47,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:47,388 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:53:47,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 01:53:47,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:53:47,589 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:47,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:47,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1692987932, now seen corresponding path program 1 times [2025-03-04 01:53:47,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:47,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822322358] [2025-03-04 01:53:47,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:47,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:47,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 01:53:47,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 01:53:47,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:47,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:49,139 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:49,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:49,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822322358] [2025-03-04 01:53:49,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822322358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:49,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:49,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 01:53:49,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456652909] [2025-03-04 01:53:49,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:49,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:53:49,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:49,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:53:49,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:53:49,142 INFO L87 Difference]: Start difference. First operand 364 states and 482 transitions. Second operand has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:51,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:51,684 INFO L93 Difference]: Finished difference Result 695 states and 918 transitions. [2025-03-04 01:53:51,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 01:53:51,684 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 164 [2025-03-04 01:53:51,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:51,686 INFO L225 Difference]: With dead ends: 695 [2025-03-04 01:53:51,686 INFO L226 Difference]: Without dead ends: 496 [2025-03-04 01:53:51,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2025-03-04 01:53:51,687 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 284 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 2031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:51,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1328 Invalid, 2031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1956 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 01:53:51,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-04 01:53:51,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 378. [2025-03-04 01:53:51,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 333 states have (on average 1.2732732732732732) internal successors, (424), 333 states have internal predecessors, (424), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:53:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 500 transitions. [2025-03-04 01:53:51,722 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 500 transitions. Word has length 164 [2025-03-04 01:53:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:51,722 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 500 transitions. [2025-03-04 01:53:51,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 500 transitions. [2025-03-04 01:53:51,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 01:53:51,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:51,723 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:53:51,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:53:51,723 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:51,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:51,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1187429307, now seen corresponding path program 1 times [2025-03-04 01:53:51,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:51,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270715496] [2025-03-04 01:53:51,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:51,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:51,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 01:53:51,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 01:53:51,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:51,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:51,970 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:51,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:51,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270715496] [2025-03-04 01:53:51,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270715496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:51,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:51,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:53:51,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130242674] [2025-03-04 01:53:51,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:51,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:53:51,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:51,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:53:51,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:53:51,971 INFO L87 Difference]: Start difference. First operand 378 states and 500 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:52,200 INFO L93 Difference]: Finished difference Result 650 states and 863 transitions. [2025-03-04 01:53:52,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:53:52,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 164 [2025-03-04 01:53:52,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:52,206 INFO L225 Difference]: With dead ends: 650 [2025-03-04 01:53:52,206 INFO L226 Difference]: Without dead ends: 462 [2025-03-04 01:53:52,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:53:52,207 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 47 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:52,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 831 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:53:52,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-04 01:53:52,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 378. [2025-03-04 01:53:52,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 333 states have (on average 1.2732732732732732) internal successors, (424), 333 states have internal predecessors, (424), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:53:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 500 transitions. [2025-03-04 01:53:52,239 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 500 transitions. Word has length 164 [2025-03-04 01:53:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:52,240 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 500 transitions. [2025-03-04 01:53:52,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:52,241 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 500 transitions. [2025-03-04 01:53:52,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 01:53:52,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:52,242 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:53:52,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:53:52,242 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:52,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:52,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1517958241, now seen corresponding path program 1 times [2025-03-04 01:53:52,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:52,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194495131] [2025-03-04 01:53:52,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:52,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:52,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 01:53:52,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 01:53:52,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:52,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:54,297 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:54,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:54,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194495131] [2025-03-04 01:53:54,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194495131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:54,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:54,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:53:54,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420485993] [2025-03-04 01:53:54,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:54,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:53:54,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:54,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:53:54,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:53:54,299 INFO L87 Difference]: Start difference. First operand 378 states and 500 transitions. Second operand has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:53:55,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:55,707 INFO L93 Difference]: Finished difference Result 618 states and 821 transitions. [2025-03-04 01:53:55,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:53:55,707 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 164 [2025-03-04 01:53:55,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:55,709 INFO L225 Difference]: With dead ends: 618 [2025-03-04 01:53:55,709 INFO L226 Difference]: Without dead ends: 429 [2025-03-04 01:53:55,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:53:55,710 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 249 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:55,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 870 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 01:53:55,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-03-04 01:53:55,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 374. [2025-03-04 01:53:55,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 329 states have (on average 1.2735562310030395) internal successors, (419), 329 states have internal predecessors, (419), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:53:55,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 495 transitions. [2025-03-04 01:53:55,740 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 495 transitions. Word has length 164 [2025-03-04 01:53:55,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:55,740 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 495 transitions. [2025-03-04 01:53:55,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:53:55,740 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 495 transitions. [2025-03-04 01:53:55,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 01:53:55,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:55,741 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:53:55,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:53:55,741 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:55,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:55,742 INFO L85 PathProgramCache]: Analyzing trace with hash -2031901178, now seen corresponding path program 1 times [2025-03-04 01:53:55,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:55,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965023937] [2025-03-04 01:53:55,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:55,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:55,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 01:53:55,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 01:53:55,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:55,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:57,396 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:57,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:57,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965023937] [2025-03-04 01:53:57,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965023937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:57,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:57,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 01:53:57,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237671069] [2025-03-04 01:53:57,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:57,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:53:57,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:57,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:53:57,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:53:57,398 INFO L87 Difference]: Start difference. First operand 374 states and 495 transitions. Second operand has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:54:00,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:54:00,323 INFO L93 Difference]: Finished difference Result 683 states and 899 transitions. [2025-03-04 01:54:00,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 01:54:00,324 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 164 [2025-03-04 01:54:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:54:00,325 INFO L225 Difference]: With dead ends: 683 [2025-03-04 01:54:00,325 INFO L226 Difference]: Without dead ends: 484 [2025-03-04 01:54:00,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2025-03-04 01:54:00,327 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 225 mSDsluCounter, 1446 mSDsCounter, 0 mSdLazyCounter, 1932 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:54:00,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1606 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1932 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 01:54:00,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-04 01:54:00,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 374. [2025-03-04 01:54:00,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 329 states have (on average 1.2735562310030395) internal successors, (419), 329 states have internal predecessors, (419), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:54:00,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 495 transitions. [2025-03-04 01:54:00,356 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 495 transitions. Word has length 164 [2025-03-04 01:54:00,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:54:00,357 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 495 transitions. [2025-03-04 01:54:00,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:54:00,357 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 495 transitions. [2025-03-04 01:54:00,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 01:54:00,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:54:00,358 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:54:00,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:54:00,358 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:54:00,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:54:00,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1947724477, now seen corresponding path program 1 times [2025-03-04 01:54:00,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:54:00,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059515078] [2025-03-04 01:54:00,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:54:00,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:54:00,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 01:54:00,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 01:54:00,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:54:00,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:54:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:54:00,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:54:00,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059515078] [2025-03-04 01:54:00,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059515078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:54:00,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:54:00,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:54:00,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318155822] [2025-03-04 01:54:00,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:54:00,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:54:00,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:54:00,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:54:00,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:54:00,559 INFO L87 Difference]: Start difference. First operand 374 states and 495 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:54:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:54:00,720 INFO L93 Difference]: Finished difference Result 577 states and 770 transitions. [2025-03-04 01:54:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:54:00,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 164 [2025-03-04 01:54:00,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:54:00,722 INFO L225 Difference]: With dead ends: 577 [2025-03-04 01:54:00,722 INFO L226 Difference]: Without dead ends: 352 [2025-03-04 01:54:00,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:54:00,723 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:54:00,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 440 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:54:00,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-04 01:54:00,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2025-03-04 01:54:00,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 307 states have (on average 1.260586319218241) internal successors, (387), 307 states have internal predecessors, (387), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:54:00,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 463 transitions. [2025-03-04 01:54:00,751 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 463 transitions. Word has length 164 [2025-03-04 01:54:00,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:54:00,751 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 463 transitions. [2025-03-04 01:54:00,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:54:00,751 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 463 transitions. [2025-03-04 01:54:00,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 01:54:00,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:54:00,752 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:54:00,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:54:00,752 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:54:00,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:54:00,752 INFO L85 PathProgramCache]: Analyzing trace with hash -277147514, now seen corresponding path program 1 times [2025-03-04 01:54:00,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:54:00,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321918617] [2025-03-04 01:54:00,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:54:00,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:54:00,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 01:54:00,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 01:54:00,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:54:00,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:54:02,704 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:54:02,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:54:02,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321918617] [2025-03-04 01:54:02,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321918617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:54:02,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:54:02,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:54:02,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254173021] [2025-03-04 01:54:02,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:54:02,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:54:02,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:54:02,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:54:02,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:54:02,706 INFO L87 Difference]: Start difference. First operand 352 states and 463 transitions. Second operand has 13 states, 11 states have (on average 6.545454545454546) internal successors, (72), 13 states have internal predecessors, (72), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:54:04,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:54:04,135 INFO L93 Difference]: Finished difference Result 626 states and 827 transitions. [2025-03-04 01:54:04,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:54:04,136 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.545454545454546) internal successors, (72), 13 states have internal predecessors, (72), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 164 [2025-03-04 01:54:04,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:54:04,137 INFO L225 Difference]: With dead ends: 626 [2025-03-04 01:54:04,137 INFO L226 Difference]: Without dead ends: 441 [2025-03-04 01:54:04,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:54:04,138 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 233 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:54:04,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 988 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:54:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-04 01:54:04,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 373. [2025-03-04 01:54:04,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 328 states have (on average 1.2652439024390243) internal successors, (415), 328 states have internal predecessors, (415), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:54:04,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 491 transitions. [2025-03-04 01:54:04,169 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 491 transitions. Word has length 164 [2025-03-04 01:54:04,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:54:04,169 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 491 transitions. [2025-03-04 01:54:04,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.545454545454546) internal successors, (72), 13 states have internal predecessors, (72), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:54:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 491 transitions. [2025-03-04 01:54:04,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-04 01:54:04,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:54:04,171 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:54:04,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:54:04,172 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:54:04,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:54:04,173 INFO L85 PathProgramCache]: Analyzing trace with hash 193568089, now seen corresponding path program 1 times [2025-03-04 01:54:04,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:54:04,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001080158] [2025-03-04 01:54:04,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:54:04,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:54:04,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 01:54:04,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 01:54:04,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:54:04,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:54:06,280 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:54:06,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:54:06,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001080158] [2025-03-04 01:54:06,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001080158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:54:06,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:54:06,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:54:06,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976548004] [2025-03-04 01:54:06,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:54:06,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:54:06,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:54:06,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:54:06,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:54:06,281 INFO L87 Difference]: Start difference. First operand 373 states and 491 transitions. Second operand has 13 states, 11 states have (on average 6.636363636363637) internal successors, (73), 13 states have internal predecessors, (73), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:54:07,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:54:07,494 INFO L93 Difference]: Finished difference Result 675 states and 892 transitions. [2025-03-04 01:54:07,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:54:07,495 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.636363636363637) internal successors, (73), 13 states have internal predecessors, (73), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 165 [2025-03-04 01:54:07,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:54:07,497 INFO L225 Difference]: With dead ends: 675 [2025-03-04 01:54:07,497 INFO L226 Difference]: Without dead ends: 475 [2025-03-04 01:54:07,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:54:07,497 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 180 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:54:07,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 976 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:54:07,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-03-04 01:54:07,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 391. [2025-03-04 01:54:07,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 346 states have (on average 1.2658959537572254) internal successors, (438), 346 states have internal predecessors, (438), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:54:07,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 514 transitions. [2025-03-04 01:54:07,529 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 514 transitions. Word has length 165 [2025-03-04 01:54:07,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:54:07,529 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 514 transitions. [2025-03-04 01:54:07,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.636363636363637) internal successors, (73), 13 states have internal predecessors, (73), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:54:07,529 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 514 transitions. [2025-03-04 01:54:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-04 01:54:07,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:54:07,530 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:54:07,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 01:54:07,530 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:54:07,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:54:07,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1816535752, now seen corresponding path program 1 times [2025-03-04 01:54:07,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:54:07,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973774252] [2025-03-04 01:54:07,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:54:07,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:54:07,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 01:54:07,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 01:54:07,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:54:07,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:54:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 63 proven. 81 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-03-04 01:54:09,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:54:09,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973774252] [2025-03-04 01:54:09,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973774252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:54:09,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054816714] [2025-03-04 01:54:09,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:54:09,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:54:09,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:54:09,274 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:54:09,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 01:54:09,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 01:54:10,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 01:54:10,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:54:10,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:54:10,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-03-04 01:54:10,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:54:10,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 31 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 45 [2025-03-04 01:54:10,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:54:11,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-04 01:54:11,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-04 01:54:12,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-04 01:54:12,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-04 01:54:12,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-04 01:54:12,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-04 01:54:13,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-04 01:54:13,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-04 01:54:14,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14