./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-s_file-32.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 a3ace122b1e1ec58f75c9939f157863ad20805c3ed845fddb96d7761951d3563 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:49:28,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:49:29,021 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:49:29,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:49:29,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:49:29,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:49:29,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:49:29,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:49:29,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:49:29,039 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:49:29,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:49:29,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:49:29,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:49:29,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:49:29,039 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:49:29,039 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:49:29,039 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:49:29,039 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:49:29,039 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:49:29,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:49:29,040 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:49:29,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:49:29,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:49:29,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:49:29,040 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:49:29,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:49:29,040 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:49:29,040 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:49:29,040 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:49:29,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:49:29,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:49:29,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:49:29,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:49:29,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:49:29,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:49:29,040 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:49:29,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:49:29,040 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:49:29,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:49:29,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:49:29,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:49:29,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:49:29,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:49:29,041 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 -> a3ace122b1e1ec58f75c9939f157863ad20805c3ed845fddb96d7761951d3563 [2025-03-08 16:49:29,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:49:29,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:49:29,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:49:29,263 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:49:29,263 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:49:29,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-32.i [2025-03-08 16:49:30,328 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1812d64ac/c5ab634710384aa5865c727d16b00d8d/FLAGbcd9adba9 [2025-03-08 16:49:30,560 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:49:30,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-32.i [2025-03-08 16:49:30,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1812d64ac/c5ab634710384aa5865c727d16b00d8d/FLAGbcd9adba9 [2025-03-08 16:49:30,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1812d64ac/c5ab634710384aa5865c727d16b00d8d [2025-03-08 16:49:30,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:49:30,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:49:30,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:49:30,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:49:30,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:49:30,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:49:30" (1/1) ... [2025-03-08 16:49:30,913 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f65a6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:30, skipping insertion in model container [2025-03-08 16:49:30,913 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:49:30" (1/1) ... [2025-03-08 16:49:30,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:49:31,010 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-s_file-32.i[916,929] [2025-03-08 16:49:31,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:49:31,059 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:49:31,066 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-s_file-32.i[916,929] [2025-03-08 16:49:31,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:49:31,130 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:49:31,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:31 WrapperNode [2025-03-08 16:49:31,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:49:31,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:49:31,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:49:31,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:49:31,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:31" (1/1) ... [2025-03-08 16:49:31,145 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:31" (1/1) ... [2025-03-08 16:49:31,172 INFO L138 Inliner]: procedures = 27, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 430 [2025-03-08 16:49:31,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:49:31,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:49:31,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:49:31,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:49:31,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:31" (1/1) ... [2025-03-08 16:49:31,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:31" (1/1) ... [2025-03-08 16:49:31,183 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:31" (1/1) ... [2025-03-08 16:49:31,204 INFO L175 MemorySlicer]: Split 125 memory accesses to 2 slices as follows [2, 123]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 28 writes are split as follows [0, 28]. [2025-03-08 16:49:31,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:31" (1/1) ... [2025-03-08 16:49:31,205 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:31" (1/1) ... [2025-03-08 16:49:31,225 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:31" (1/1) ... [2025-03-08 16:49:31,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:31" (1/1) ... [2025-03-08 16:49:31,232 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:31" (1/1) ... [2025-03-08 16:49:31,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:31" (1/1) ... [2025-03-08 16:49:31,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:49:31,240 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:49:31,240 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:49:31,240 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:49:31,241 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:31" (1/1) ... [2025-03-08 16:49:31,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:49:31,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:49:31,268 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-08 16:49:31,271 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-08 16:49:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:49:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 16:49:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 16:49:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:49:31,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:49:31,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:49:31,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:49:31,291 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:49:31,291 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:49:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:49:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:49:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:49:31,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:49:31,369 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:49:31,370 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:49:31,668 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: havoc property_#t~ite85#1;havoc property_#t~mem84#1;havoc property_#t~mem75#1;havoc property_#t~mem71#1;havoc property_#t~ite74#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem76#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem77#1;havoc property_#t~ite80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem82#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem89#1;havoc property_#t~ite96#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem92#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~mem93#1;havoc property_#t~short98#1;havoc property_#t~mem101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite123#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~ite120#1;havoc property_#t~mem105#1;havoc property_#t~ite111#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem119#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite118#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short124#1; [2025-03-08 16:49:31,694 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-03-08 16:49:31,694 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:49:31,701 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:49:31,702 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:49:31,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:49:31 BoogieIcfgContainer [2025-03-08 16:49:31,702 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:49:31,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:49:31,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:49:31,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:49:31,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:49:30" (1/3) ... [2025-03-08 16:49:31,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5ef9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:49:31, skipping insertion in model container [2025-03-08 16:49:31,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:31" (2/3) ... [2025-03-08 16:49:31,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5ef9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:49:31, skipping insertion in model container [2025-03-08 16:49:31,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:49:31" (3/3) ... [2025-03-08 16:49:31,709 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-32.i [2025-03-08 16:49:31,719 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:49:31,720 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-32.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:49:31,765 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:49:31,776 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;@39f6b06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:49:31,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:49:31,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 78 states have internal predecessors, (105), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:49:31,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:49:31,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:31,787 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:31,788 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:31,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:31,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1311769662, now seen corresponding path program 1 times [2025-03-08 16:49:31,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:31,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278957140] [2025-03-08 16:49:31,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:31,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:31,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:49:31,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:49:31,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:31,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 16:49:32,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:32,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278957140] [2025-03-08 16:49:32,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278957140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:49:32,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720209007] [2025-03-08 16:49:32,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:32,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:49:32,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:49:32,008 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-08 16:49:32,010 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-08 16:49:32,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:49:32,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:49:32,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:32,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:32,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:49:32,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:49:32,193 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 16:49:32,193 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:49:32,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720209007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:32,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:49:32,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:49:32,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119553220] [2025-03-08 16:49:32,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:32,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:49:32,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:32,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:49:32,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:49:32,212 INFO L87 Difference]: Start difference. First operand has 98 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 78 states have internal predecessors, (105), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:49:32,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:32,234 INFO L93 Difference]: Finished difference Result 190 states and 295 transitions. [2025-03-08 16:49:32,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:49:32,236 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2025-03-08 16:49:32,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:32,241 INFO L225 Difference]: With dead ends: 190 [2025-03-08 16:49:32,242 INFO L226 Difference]: Without dead ends: 95 [2025-03-08 16:49:32,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-08 16:49:32,248 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:32,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:49:32,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-08 16:49:32,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-08 16:49:32,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.28) internal successors, (96), 75 states have internal predecessors, (96), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:49:32,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2025-03-08 16:49:32,286 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 129 [2025-03-08 16:49:32,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:32,286 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2025-03-08 16:49:32,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:49:32,288 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2025-03-08 16:49:32,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:49:32,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:32,291 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:32,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:49:32,491 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-08 16:49:32,492 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:32,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:32,493 INFO L85 PathProgramCache]: Analyzing trace with hash 786408876, now seen corresponding path program 1 times [2025-03-08 16:49:32,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:32,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735127675] [2025-03-08 16:49:32,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:32,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:32,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:49:32,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:49:32,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:32,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:33,067 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:49:33,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:33,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735127675] [2025-03-08 16:49:33,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735127675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:33,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:33,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:49:33,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510196302] [2025-03-08 16:49:33,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:33,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:49:33,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:33,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:49:33,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:49:33,070 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:49:33,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:33,361 INFO L93 Difference]: Finished difference Result 318 states and 444 transitions. [2025-03-08 16:49:33,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:49:33,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2025-03-08 16:49:33,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:33,363 INFO L225 Difference]: With dead ends: 318 [2025-03-08 16:49:33,364 INFO L226 Difference]: Without dead ends: 226 [2025-03-08 16:49:33,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-08 16:49:33,365 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 200 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:33,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 271 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:49:33,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-08 16:49:33,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 193. [2025-03-08 16:49:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 154 states have (on average 1.2857142857142858) internal successors, (198), 154 states have internal predecessors, (198), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 16:49:33,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 270 transitions. [2025-03-08 16:49:33,387 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 270 transitions. Word has length 129 [2025-03-08 16:49:33,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:33,388 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 270 transitions. [2025-03-08 16:49:33,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:49:33,388 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 270 transitions. [2025-03-08 16:49:33,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 16:49:33,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:33,389 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:33,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:49:33,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:33,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:33,390 INFO L85 PathProgramCache]: Analyzing trace with hash -153570148, now seen corresponding path program 1 times [2025-03-08 16:49:33,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:33,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534353665] [2025-03-08 16:49:33,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:33,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:33,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 16:49:33,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 16:49:33,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:33,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:34,830 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:49:34,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:34,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534353665] [2025-03-08 16:49:34,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534353665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:34,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:34,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:49:34,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571454107] [2025-03-08 16:49:34,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:34,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:49:34,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:34,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:49:34,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:49:34,834 INFO L87 Difference]: Start difference. First operand 193 states and 270 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:49:35,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:35,388 INFO L93 Difference]: Finished difference Result 511 states and 714 transitions. [2025-03-08 16:49:35,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:49:35,388 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 137 [2025-03-08 16:49:35,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:35,392 INFO L225 Difference]: With dead ends: 511 [2025-03-08 16:49:35,392 INFO L226 Difference]: Without dead ends: 321 [2025-03-08 16:49:35,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:49:35,393 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 74 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:35,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 869 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:49:35,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-08 16:49:35,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 317. [2025-03-08 16:49:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 268 states have (on average 1.3171641791044777) internal successors, (353), 270 states have internal predecessors, (353), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 16:49:35,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 441 transitions. [2025-03-08 16:49:35,433 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 441 transitions. Word has length 137 [2025-03-08 16:49:35,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:35,434 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 441 transitions. [2025-03-08 16:49:35,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:49:35,434 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 441 transitions. [2025-03-08 16:49:35,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:49:35,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:35,437 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:35,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:49:35,438 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:35,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:35,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1238800959, now seen corresponding path program 1 times [2025-03-08 16:49:35,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:35,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267047492] [2025-03-08 16:49:35,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:35,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:35,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:49:35,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:49:35,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:35,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:37,167 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:49:37,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:37,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267047492] [2025-03-08 16:49:37,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267047492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:37,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:37,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:49:37,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976009862] [2025-03-08 16:49:37,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:37,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:49:37,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:37,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:49:37,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:49:37,169 INFO L87 Difference]: Start difference. First operand 317 states and 441 transitions. Second operand has 12 states, 9 states have (on average 5.777777777777778) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:49:37,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:37,994 INFO L93 Difference]: Finished difference Result 683 states and 951 transitions. [2025-03-08 16:49:37,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 16:49:37,994 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 5.777777777777778) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 139 [2025-03-08 16:49:37,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:37,997 INFO L225 Difference]: With dead ends: 683 [2025-03-08 16:49:37,997 INFO L226 Difference]: Without dead ends: 369 [2025-03-08 16:49:37,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:49:37,999 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 64 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:37,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1085 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:49:38,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-08 16:49:38,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 332. [2025-03-08 16:49:38,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 283 states have (on average 1.325088339222615) internal successors, (375), 285 states have internal predecessors, (375), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 16:49:38,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 463 transitions. [2025-03-08 16:49:38,020 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 463 transitions. Word has length 139 [2025-03-08 16:49:38,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:38,021 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 463 transitions. [2025-03-08 16:49:38,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 5.777777777777778) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:49:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 463 transitions. [2025-03-08 16:49:38,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:49:38,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:38,022 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:38,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:49:38,023 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:38,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:38,023 INFO L85 PathProgramCache]: Analyzing trace with hash -545676001, now seen corresponding path program 1 times [2025-03-08 16:49:38,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:38,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169870035] [2025-03-08 16:49:38,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:38,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:38,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:49:38,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:49:38,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:38,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:39,525 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:49:39,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:39,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169870035] [2025-03-08 16:49:39,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169870035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:39,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:39,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:49:39,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532353512] [2025-03-08 16:49:39,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:39,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:49:39,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:39,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:49:39,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:49:39,527 INFO L87 Difference]: Start difference. First operand 332 states and 463 transitions. Second operand has 14 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:49:40,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:40,173 INFO L93 Difference]: Finished difference Result 655 states and 914 transitions. [2025-03-08 16:49:40,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:49:40,174 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 139 [2025-03-08 16:49:40,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:40,175 INFO L225 Difference]: With dead ends: 655 [2025-03-08 16:49:40,176 INFO L226 Difference]: Without dead ends: 326 [2025-03-08 16:49:40,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-03-08 16:49:40,177 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 57 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:40,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 857 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:49:40,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-08 16:49:40,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 322. [2025-03-08 16:49:40,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 273 states have (on average 1.3223443223443223) internal successors, (361), 275 states have internal predecessors, (361), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 16:49:40,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 449 transitions. [2025-03-08 16:49:40,195 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 449 transitions. Word has length 139 [2025-03-08 16:49:40,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:40,197 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 449 transitions. [2025-03-08 16:49:40,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:49:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 449 transitions. [2025-03-08 16:49:40,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:49:40,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:40,199 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:40,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:49:40,199 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:40,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:40,200 INFO L85 PathProgramCache]: Analyzing trace with hash 981150675, now seen corresponding path program 1 times [2025-03-08 16:49:40,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:40,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942686] [2025-03-08 16:49:40,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:40,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:40,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:49:40,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:49:40,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:40,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:40,301 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:49:40,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:40,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942686] [2025-03-08 16:49:40,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942686] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:49:40,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503583343] [2025-03-08 16:49:40,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:40,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:49:40,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:49:40,304 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-08 16:49:40,306 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-08 16:49:40,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:49:40,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:49:40,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:40,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:40,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:49:40,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:49:40,442 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:49:40,442 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:49:40,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503583343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:40,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:49:40,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-08 16:49:40,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650358643] [2025-03-08 16:49:40,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:40,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:49:40,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:40,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:49:40,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:49:40,444 INFO L87 Difference]: Start difference. First operand 322 states and 449 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:49:40,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:40,471 INFO L93 Difference]: Finished difference Result 653 states and 911 transitions. [2025-03-08 16:49:40,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:49:40,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2025-03-08 16:49:40,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:40,474 INFO L225 Difference]: With dead ends: 653 [2025-03-08 16:49:40,474 INFO L226 Difference]: Without dead ends: 334 [2025-03-08 16:49:40,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 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-08 16:49:40,475 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 500 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-08 16:49:40,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 500 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:49:40,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-08 16:49:40,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2025-03-08 16:49:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 285 states have (on average 1.3087719298245615) internal successors, (373), 287 states have internal predecessors, (373), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 16:49:40,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 461 transitions. [2025-03-08 16:49:40,497 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 461 transitions. Word has length 139 [2025-03-08 16:49:40,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:40,498 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 461 transitions. [2025-03-08 16:49:40,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:49:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 461 transitions. [2025-03-08 16:49:40,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:49:40,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:40,501 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:40,507 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-08 16:49:40,705 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,SelfDestructingSolverStorable5 [2025-03-08 16:49:40,705 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:40,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:40,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1788128770, now seen corresponding path program 1 times [2025-03-08 16:49:40,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:40,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326447829] [2025-03-08 16:49:40,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:40,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:40,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:49:40,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:49:40,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:40,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:41,844 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:49:41,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:41,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326447829] [2025-03-08 16:49:41,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326447829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:41,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:41,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 16:49:41,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050690943] [2025-03-08 16:49:41,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:41,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 16:49:41,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:41,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 16:49:41,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:49:41,846 INFO L87 Difference]: Start difference. First operand 334 states and 461 transitions. Second operand has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:49:42,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:42,728 INFO L93 Difference]: Finished difference Result 787 states and 1078 transitions. [2025-03-08 16:49:42,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 16:49:42,729 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 141 [2025-03-08 16:49:42,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:42,732 INFO L225 Difference]: With dead ends: 787 [2025-03-08 16:49:42,732 INFO L226 Difference]: Without dead ends: 456 [2025-03-08 16:49:42,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2025-03-08 16:49:42,733 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 127 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:42,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1697 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:49:42,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-03-08 16:49:42,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 364. [2025-03-08 16:49:42,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 315 states have (on average 1.307936507936508) internal successors, (412), 317 states have internal predecessors, (412), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 16:49:42,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 500 transitions. [2025-03-08 16:49:42,764 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 500 transitions. Word has length 141 [2025-03-08 16:49:42,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:42,764 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 500 transitions. [2025-03-08 16:49:42,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:49:42,764 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 500 transitions. [2025-03-08 16:49:42,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:49:42,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:42,766 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:42,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:49:42,766 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:42,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:42,766 INFO L85 PathProgramCache]: Analyzing trace with hash 280515349, now seen corresponding path program 1 times [2025-03-08 16:49:42,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:42,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890305867] [2025-03-08 16:49:42,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:42,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:42,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:49:42,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:49:42,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:42,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:49:43,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:43,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890305867] [2025-03-08 16:49:43,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890305867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:43,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:43,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:49:43,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781863473] [2025-03-08 16:49:43,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:43,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:49:43,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:43,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:49:43,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:49:43,494 INFO L87 Difference]: Start difference. First operand 364 states and 500 transitions. Second operand has 10 states, 8 states have (on average 6.75) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:49:44,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:44,084 INFO L93 Difference]: Finished difference Result 1016 states and 1385 transitions. [2025-03-08 16:49:44,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:49:44,085 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.75) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 141 [2025-03-08 16:49:44,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:44,088 INFO L225 Difference]: With dead ends: 1016 [2025-03-08 16:49:44,088 INFO L226 Difference]: Without dead ends: 655 [2025-03-08 16:49:44,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:49:44,089 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 207 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:44,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 474 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:49:44,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-03-08 16:49:44,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 632. [2025-03-08 16:49:44,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 529 states have (on average 1.281663516068053) internal successors, (678), 534 states have internal predecessors, (678), 92 states have call successors, (92), 10 states have call predecessors, (92), 10 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 16:49:44,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 862 transitions. [2025-03-08 16:49:44,119 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 862 transitions. Word has length 141 [2025-03-08 16:49:44,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:44,119 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 862 transitions. [2025-03-08 16:49:44,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.75) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:49:44,120 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 862 transitions. [2025-03-08 16:49:44,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:49:44,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:44,121 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:44,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:49:44,121 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:44,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:44,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1747853127, now seen corresponding path program 1 times [2025-03-08 16:49:44,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:44,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034327295] [2025-03-08 16:49:44,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:44,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:44,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:49:44,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:49:44,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:44,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:49:46,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:46,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034327295] [2025-03-08 16:49:46,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034327295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:46,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:46,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-08 16:49:46,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153132780] [2025-03-08 16:49:46,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:46,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 16:49:46,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:46,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 16:49:46,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2025-03-08 16:49:46,002 INFO L87 Difference]: Start difference. First operand 632 states and 862 transitions. Second operand has 23 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 23 states have internal predecessors, (54), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-08 16:49:48,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:48,014 INFO L93 Difference]: Finished difference Result 1228 states and 1597 transitions. [2025-03-08 16:49:48,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 16:49:48,015 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 23 states have internal predecessors, (54), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 6 states have call successors, (18) Word has length 141 [2025-03-08 16:49:48,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:48,023 INFO L225 Difference]: With dead ends: 1228 [2025-03-08 16:49:48,024 INFO L226 Difference]: Without dead ends: 1226 [2025-03-08 16:49:48,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=326, Invalid=2326, Unknown=0, NotChecked=0, Total=2652 [2025-03-08 16:49:48,026 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 633 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 2233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:48,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 975 Invalid, 2233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 16:49:48,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2025-03-08 16:49:48,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1051. [2025-03-08 16:49:48,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 906 states have (on average 1.2516556291390728) internal successors, (1134), 918 states have internal predecessors, (1134), 122 states have call successors, (122), 22 states have call predecessors, (122), 22 states have return successors, (122), 110 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-08 16:49:48,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1378 transitions. [2025-03-08 16:49:48,101 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1378 transitions. Word has length 141 [2025-03-08 16:49:48,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:48,101 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1378 transitions. [2025-03-08 16:49:48,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 23 states have internal predecessors, (54), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-08 16:49:48,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1378 transitions. [2025-03-08 16:49:48,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 16:49:48,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:48,103 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:48,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:49:48,104 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:48,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:48,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1868612061, now seen corresponding path program 1 times [2025-03-08 16:49:48,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:48,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119988379] [2025-03-08 16:49:48,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:48,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:48,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:49:48,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:49:48,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:48,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:49:49,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:49,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119988379] [2025-03-08 16:49:49,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119988379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:49,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:49,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 16:49:49,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683169258] [2025-03-08 16:49:49,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:49,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:49:49,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:49,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:49:49,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:49:49,059 INFO L87 Difference]: Start difference. First operand 1051 states and 1378 transitions. Second operand has 15 states, 13 states have (on average 4.230769230769231) internal successors, (55), 15 states have internal predecessors, (55), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:49:49,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:49,685 INFO L93 Difference]: Finished difference Result 2176 states and 2847 transitions. [2025-03-08 16:49:49,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 16:49:49,686 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.230769230769231) internal successors, (55), 15 states have internal predecessors, (55), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 142 [2025-03-08 16:49:49,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:49,693 INFO L225 Difference]: With dead ends: 2176 [2025-03-08 16:49:49,693 INFO L226 Difference]: Without dead ends: 1133 [2025-03-08 16:49:49,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:49:49,696 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 52 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:49,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1475 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:49:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2025-03-08 16:49:49,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1009. [2025-03-08 16:49:49,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 864 states have (on average 1.25) internal successors, (1080), 876 states have internal predecessors, (1080), 122 states have call successors, (122), 22 states have call predecessors, (122), 22 states have return successors, (122), 110 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-08 16:49:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1324 transitions. [2025-03-08 16:49:49,745 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1324 transitions. Word has length 142 [2025-03-08 16:49:49,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:49,745 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1324 transitions. [2025-03-08 16:49:49,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.230769230769231) internal successors, (55), 15 states have internal predecessors, (55), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:49:49,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1324 transitions. [2025-03-08 16:49:49,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 16:49:49,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:49,747 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:49,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:49:49,747 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:49,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:49,747 INFO L85 PathProgramCache]: Analyzing trace with hash 801936092, now seen corresponding path program 1 times [2025-03-08 16:49:49,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:49,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051635856] [2025-03-08 16:49:49,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:49,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:49,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:49:49,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:49:49,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:49,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:50,276 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:49:50,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:50,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051635856] [2025-03-08 16:49:50,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051635856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:50,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:50,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:49:50,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197795272] [2025-03-08 16:49:50,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:50,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:49:50,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:50,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:49:50,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:49:50,278 INFO L87 Difference]: Start difference. First operand 1009 states and 1324 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:49:50,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:50,725 INFO L93 Difference]: Finished difference Result 2040 states and 2687 transitions. [2025-03-08 16:49:50,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:49:50,725 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 142 [2025-03-08 16:49:50,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:50,732 INFO L225 Difference]: With dead ends: 2040 [2025-03-08 16:49:50,732 INFO L226 Difference]: Without dead ends: 1413 [2025-03-08 16:49:50,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:49:50,734 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 68 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:50,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1104 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:49:50,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2025-03-08 16:49:50,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1391. [2025-03-08 16:49:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1204 states have (on average 1.2574750830564785) internal successors, (1514), 1222 states have internal predecessors, (1514), 158 states have call successors, (158), 28 states have call predecessors, (158), 28 states have return successors, (158), 140 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-08 16:49:50,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1830 transitions. [2025-03-08 16:49:50,792 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1830 transitions. Word has length 142 [2025-03-08 16:49:50,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:50,792 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 1830 transitions. [2025-03-08 16:49:50,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:49:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1830 transitions. [2025-03-08 16:49:50,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 16:49:50,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:50,795 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:50,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:49:50,795 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:50,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:50,796 INFO L85 PathProgramCache]: Analyzing trace with hash 646521203, now seen corresponding path program 1 times [2025-03-08 16:49:50,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:50,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120829407] [2025-03-08 16:49:50,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:50,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:50,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 16:49:50,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 16:49:50,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:50,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:49:51,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:51,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120829407] [2025-03-08 16:49:51,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120829407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:51,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:51,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:49:51,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398881222] [2025-03-08 16:49:51,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:51,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:49:51,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:51,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:49:51,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:49:51,069 INFO L87 Difference]: Start difference. First operand 1391 states and 1830 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:49:51,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:51,332 INFO L93 Difference]: Finished difference Result 3200 states and 4193 transitions. [2025-03-08 16:49:51,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:49:51,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 143 [2025-03-08 16:49:51,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:51,339 INFO L225 Difference]: With dead ends: 3200 [2025-03-08 16:49:51,340 INFO L226 Difference]: Without dead ends: 1817 [2025-03-08 16:49:51,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:49:51,342 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 71 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:51,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 491 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:49:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2025-03-08 16:49:51,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1783. [2025-03-08 16:49:51,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1528 states have (on average 1.2395287958115184) internal successors, (1894), 1552 states have internal predecessors, (1894), 214 states have call successors, (214), 40 states have call predecessors, (214), 40 states have return successors, (214), 190 states have call predecessors, (214), 214 states have call successors, (214) [2025-03-08 16:49:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2322 transitions. [2025-03-08 16:49:51,410 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2322 transitions. Word has length 143 [2025-03-08 16:49:51,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:51,411 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2322 transitions. [2025-03-08 16:49:51,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:49:51,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2322 transitions. [2025-03-08 16:49:51,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 16:49:51,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:51,412 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:51,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 16:49:51,413 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:51,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:51,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1403197884, now seen corresponding path program 1 times [2025-03-08 16:49:51,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:51,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290943615] [2025-03-08 16:49:51,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:51,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:51,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 16:49:51,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 16:49:51,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:51,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:49:52,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:52,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290943615] [2025-03-08 16:49:52,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290943615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:52,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:52,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:49:52,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101620596] [2025-03-08 16:49:52,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:52,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:49:52,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:52,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:49:52,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:49:52,381 INFO L87 Difference]: Start difference. First operand 1783 states and 2322 transitions. Second operand has 9 states, 7 states have (on average 8.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:49:52,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:52,725 INFO L93 Difference]: Finished difference Result 4058 states and 5266 transitions. [2025-03-08 16:49:52,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:49:52,726 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 143 [2025-03-08 16:49:52,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:52,734 INFO L225 Difference]: With dead ends: 4058 [2025-03-08 16:49:52,734 INFO L226 Difference]: Without dead ends: 2291 [2025-03-08 16:49:52,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:49:52,738 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 35 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:52,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 751 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:49:52,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2025-03-08 16:49:52,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2107. [2025-03-08 16:49:52,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2107 states, 1852 states have (on average 1.232181425485961) internal successors, (2282), 1876 states have internal predecessors, (2282), 214 states have call successors, (214), 40 states have call predecessors, (214), 40 states have return successors, (214), 190 states have call predecessors, (214), 214 states have call successors, (214) [2025-03-08 16:49:52,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 2710 transitions. [2025-03-08 16:49:52,811 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 2710 transitions. Word has length 143 [2025-03-08 16:49:52,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:52,811 INFO L471 AbstractCegarLoop]: Abstraction has 2107 states and 2710 transitions. [2025-03-08 16:49:52,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:49:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 2710 transitions. [2025-03-08 16:49:52,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 16:49:52,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:52,814 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:52,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:49:52,814 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:52,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:52,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1337386401, now seen corresponding path program 1 times [2025-03-08 16:49:52,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:52,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183417095] [2025-03-08 16:49:52,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:52,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:52,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 16:49:52,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 16:49:52,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:52,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:53,136 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:49:53,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:53,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183417095] [2025-03-08 16:49:53,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183417095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:53,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:53,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:49:53,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227682419] [2025-03-08 16:49:53,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:53,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:49:53,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:53,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:49:53,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:49:53,140 INFO L87 Difference]: Start difference. First operand 2107 states and 2710 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:49:53,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:53,422 INFO L93 Difference]: Finished difference Result 3551 states and 4578 transitions. [2025-03-08 16:49:53,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:49:53,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2025-03-08 16:49:53,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:53,429 INFO L225 Difference]: With dead ends: 3551 [2025-03-08 16:49:53,429 INFO L226 Difference]: Without dead ends: 2085 [2025-03-08 16:49:53,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:49:53,432 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 66 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:53,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 607 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:49:53,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2025-03-08 16:49:53,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 2081. [2025-03-08 16:49:53,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2081 states, 1820 states have (on average 1.2247252747252748) internal successors, (2229), 1844 states have internal predecessors, (2229), 218 states have call successors, (218), 42 states have call predecessors, (218), 42 states have return successors, (218), 194 states have call predecessors, (218), 218 states have call successors, (218) [2025-03-08 16:49:53,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 2665 transitions. [2025-03-08 16:49:53,498 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 2665 transitions. Word has length 144 [2025-03-08 16:49:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:53,500 INFO L471 AbstractCegarLoop]: Abstraction has 2081 states and 2665 transitions. [2025-03-08 16:49:53,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:49:53,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2665 transitions. [2025-03-08 16:49:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 16:49:53,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:53,502 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:53,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 16:49:53,502 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:53,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:53,503 INFO L85 PathProgramCache]: Analyzing trace with hash 667856171, now seen corresponding path program 1 times [2025-03-08 16:49:53,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:53,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964530650] [2025-03-08 16:49:53,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:53,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:53,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 16:49:53,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 16:49:53,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:53,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:55,400 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:49:55,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:55,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964530650] [2025-03-08 16:49:55,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964530650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:55,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:55,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 16:49:55,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058259653] [2025-03-08 16:49:55,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:55,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 16:49:55,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:55,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 16:49:55,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:49:55,402 INFO L87 Difference]: Start difference. First operand 2081 states and 2665 transitions. Second operand has 18 states, 15 states have (on average 3.8) internal successors, (57), 18 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:49:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:57,463 INFO L93 Difference]: Finished difference Result 4168 states and 5333 transitions. [2025-03-08 16:49:57,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 16:49:57,464 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.8) internal successors, (57), 18 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 144 [2025-03-08 16:49:57,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:57,470 INFO L225 Difference]: With dead ends: 4168 [2025-03-08 16:49:57,471 INFO L226 Difference]: Without dead ends: 2103 [2025-03-08 16:49:57,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 16:49:57,474 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 285 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:57,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1010 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 16:49:57,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2025-03-08 16:49:57,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 2068. [2025-03-08 16:49:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2068 states, 1807 states have (on average 1.2257885998893192) internal successors, (2215), 1831 states have internal predecessors, (2215), 218 states have call successors, (218), 42 states have call predecessors, (218), 42 states have return successors, (218), 194 states have call predecessors, (218), 218 states have call successors, (218) [2025-03-08 16:49:57,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 2651 transitions. [2025-03-08 16:49:57,540 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 2651 transitions. Word has length 144 [2025-03-08 16:49:57,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:57,540 INFO L471 AbstractCegarLoop]: Abstraction has 2068 states and 2651 transitions. [2025-03-08 16:49:57,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.8) internal successors, (57), 18 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:49:57,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2651 transitions. [2025-03-08 16:49:57,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:49:57,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:57,542 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:57,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 16:49:57,542 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:57,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:57,543 INFO L85 PathProgramCache]: Analyzing trace with hash -378721925, now seen corresponding path program 1 times [2025-03-08 16:49:57,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:57,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147070484] [2025-03-08 16:49:57,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:57,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:57,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:49:57,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:49:57,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:57,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:58,172 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:49:58,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:58,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147070484] [2025-03-08 16:49:58,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147070484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:58,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:58,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:49:58,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097784920] [2025-03-08 16:49:58,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:58,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:49:58,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:58,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:49:58,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:49:58,174 INFO L87 Difference]: Start difference. First operand 2068 states and 2651 transitions. Second operand has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:49:58,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:58,569 INFO L93 Difference]: Finished difference Result 4103 states and 5249 transitions. [2025-03-08 16:49:58,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:49:58,571 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2025-03-08 16:49:58,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:58,578 INFO L225 Difference]: With dead ends: 4103 [2025-03-08 16:49:58,578 INFO L226 Difference]: Without dead ends: 2051 [2025-03-08 16:49:58,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:49:58,581 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 55 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:58,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 414 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:49:58,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2025-03-08 16:49:58,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 1539. [2025-03-08 16:49:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 1360 states have (on average 1.214705882352941) internal successors, (1652), 1378 states have internal predecessors, (1652), 144 states have call successors, (144), 34 states have call predecessors, (144), 34 states have return successors, (144), 126 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-08 16:49:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 1940 transitions. [2025-03-08 16:49:58,638 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 1940 transitions. Word has length 145 [2025-03-08 16:49:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:58,638 INFO L471 AbstractCegarLoop]: Abstraction has 1539 states and 1940 transitions. [2025-03-08 16:49:58,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:49:58,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 1940 transitions. [2025-03-08 16:49:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:49:58,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:58,640 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:58,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 16:49:58,641 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:58,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:58,641 INFO L85 PathProgramCache]: Analyzing trace with hash -367239370, now seen corresponding path program 1 times [2025-03-08 16:49:58,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:58,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275824813] [2025-03-08 16:49:58,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:58,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:58,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:49:58,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:49:58,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:58,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:49:58,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:58,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275824813] [2025-03-08 16:49:58,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275824813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:58,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:58,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:49:58,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774751207] [2025-03-08 16:49:58,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:58,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:49:58,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:58,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:49:58,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:49:58,953 INFO L87 Difference]: Start difference. First operand 1539 states and 1940 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:49:59,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:59,174 INFO L93 Difference]: Finished difference Result 3266 states and 4120 transitions. [2025-03-08 16:49:59,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:49:59,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 145 [2025-03-08 16:49:59,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:59,179 INFO L225 Difference]: With dead ends: 3266 [2025-03-08 16:49:59,180 INFO L226 Difference]: Without dead ends: 1743 [2025-03-08 16:49:59,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:49:59,182 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 74 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:59,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 466 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:49:59,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2025-03-08 16:49:59,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1739. [2025-03-08 16:49:59,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1533 states have (on average 1.20808871493803) internal successors, (1852), 1553 states have internal predecessors, (1852), 166 states have call successors, (166), 39 states have call predecessors, (166), 39 states have return successors, (166), 146 states have call predecessors, (166), 166 states have call successors, (166) [2025-03-08 16:49:59,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2184 transitions. [2025-03-08 16:49:59,246 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2184 transitions. Word has length 145 [2025-03-08 16:49:59,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:59,247 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2184 transitions. [2025-03-08 16:49:59,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:49:59,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2184 transitions. [2025-03-08 16:49:59,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:49:59,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:59,248 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:59,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 16:49:59,248 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:59,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:59,249 INFO L85 PathProgramCache]: Analyzing trace with hash -563752875, now seen corresponding path program 1 times [2025-03-08 16:49:59,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:59,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021100956] [2025-03-08 16:49:59,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:59,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:59,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:49:59,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:49:59,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:59,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:59,343 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:49:59,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:49:59,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021100956] [2025-03-08 16:49:59,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021100956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:49:59,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398140154] [2025-03-08 16:49:59,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:59,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:49:59,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:49:59,346 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-08 16:49:59,350 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-08 16:49:59,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:49:59,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:49:59,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:59,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:59,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 16:49:59,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:49:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:49:59,532 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:49:59,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398140154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:59,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:49:59,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2025-03-08 16:49:59,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599688036] [2025-03-08 16:49:59,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:59,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:49:59,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:49:59,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:49:59,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:49:59,533 INFO L87 Difference]: Start difference. First operand 1739 states and 2184 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:49:59,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:59,600 INFO L93 Difference]: Finished difference Result 3516 states and 4412 transitions. [2025-03-08 16:49:59,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:49:59,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-08 16:49:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:59,606 INFO L225 Difference]: With dead ends: 3516 [2025-03-08 16:49:59,606 INFO L226 Difference]: Without dead ends: 1793 [2025-03-08 16:49:59,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:49:59,609 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:59,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 742 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:49:59,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2025-03-08 16:49:59,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1721. [2025-03-08 16:49:59,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1515 states have (on average 1.2046204620462047) internal successors, (1825), 1535 states have internal predecessors, (1825), 166 states have call successors, (166), 39 states have call predecessors, (166), 39 states have return successors, (166), 146 states have call predecessors, (166), 166 states have call successors, (166) [2025-03-08 16:49:59,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2157 transitions. [2025-03-08 16:49:59,685 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2157 transitions. Word has length 145 [2025-03-08 16:49:59,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:59,686 INFO L471 AbstractCegarLoop]: Abstraction has 1721 states and 2157 transitions. [2025-03-08 16:49:59,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:49:59,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2157 transitions. [2025-03-08 16:49:59,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:49:59,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:59,687 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:59,694 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-08 16:49:59,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 16:49:59,888 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:59,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:59,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1612003851, now seen corresponding path program 1 times [2025-03-08 16:49:59,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:49:59,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523259076] [2025-03-08 16:49:59,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:59,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:49:59,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:49:59,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:49:59,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:59,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:00,472 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:50:00,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:00,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523259076] [2025-03-08 16:50:00,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523259076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:00,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:00,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:50:00,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093983244] [2025-03-08 16:50:00,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:00,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:50:00,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:00,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:50:00,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:50:00,474 INFO L87 Difference]: Start difference. First operand 1721 states and 2157 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:50:00,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:00,836 INFO L93 Difference]: Finished difference Result 2927 states and 3677 transitions. [2025-03-08 16:50:00,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 16:50:00,836 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 145 [2025-03-08 16:50:00,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:00,841 INFO L225 Difference]: With dead ends: 2927 [2025-03-08 16:50:00,842 INFO L226 Difference]: Without dead ends: 1751 [2025-03-08 16:50:00,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:50:00,844 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 59 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:00,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1193 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:50:00,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2025-03-08 16:50:00,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1649. [2025-03-08 16:50:00,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1454 states have (on average 1.2056396148555708) internal successors, (1753), 1472 states have internal predecessors, (1753), 156 states have call successors, (156), 38 states have call predecessors, (156), 38 states have return successors, (156), 138 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-08 16:50:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2065 transitions. [2025-03-08 16:50:00,902 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2065 transitions. Word has length 145 [2025-03-08 16:50:00,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:00,903 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2065 transitions. [2025-03-08 16:50:00,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:50:00,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2065 transitions. [2025-03-08 16:50:00,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:50:00,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:00,904 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:00,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 16:50:00,904 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:00,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:00,905 INFO L85 PathProgramCache]: Analyzing trace with hash -583498748, now seen corresponding path program 1 times [2025-03-08 16:50:00,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:00,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196668790] [2025-03-08 16:50:00,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:00,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:00,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:50:00,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:50:00,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:00,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:50:02,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:02,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196668790] [2025-03-08 16:50:02,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196668790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:02,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:02,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 16:50:02,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130163237] [2025-03-08 16:50:02,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:02,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 16:50:02,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:02,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 16:50:02,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:50:02,467 INFO L87 Difference]: Start difference. First operand 1649 states and 2065 transitions. Second operand has 18 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 18 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:50:03,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:03,540 INFO L93 Difference]: Finished difference Result 3544 states and 4421 transitions. [2025-03-08 16:50:03,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 16:50:03,541 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 18 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 145 [2025-03-08 16:50:03,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:03,547 INFO L225 Difference]: With dead ends: 3544 [2025-03-08 16:50:03,547 INFO L226 Difference]: Without dead ends: 1911 [2025-03-08 16:50:03,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2025-03-08 16:50:03,550 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 226 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:03,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1436 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:50:03,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2025-03-08 16:50:03,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1611. [2025-03-08 16:50:03,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1418 states have (on average 1.2094499294781382) internal successors, (1715), 1435 states have internal predecessors, (1715), 152 states have call successors, (152), 40 states have call predecessors, (152), 40 states have return successors, (152), 135 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-08 16:50:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2019 transitions. [2025-03-08 16:50:03,638 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2019 transitions. Word has length 145 [2025-03-08 16:50:03,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:03,639 INFO L471 AbstractCegarLoop]: Abstraction has 1611 states and 2019 transitions. [2025-03-08 16:50:03,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 18 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:50:03,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2019 transitions. [2025-03-08 16:50:03,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:50:03,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:03,642 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:03,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 16:50:03,642 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:03,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:03,643 INFO L85 PathProgramCache]: Analyzing trace with hash 876616875, now seen corresponding path program 1 times [2025-03-08 16:50:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:03,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259985525] [2025-03-08 16:50:03,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:03,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:03,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:50:03,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:50:03,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:03,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:50:05,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:05,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259985525] [2025-03-08 16:50:05,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259985525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:05,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:05,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 16:50:05,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700670903] [2025-03-08 16:50:05,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:05,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 16:50:05,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:05,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 16:50:05,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2025-03-08 16:50:05,542 INFO L87 Difference]: Start difference. First operand 1611 states and 2019 transitions. Second operand has 19 states, 16 states have (on average 3.625) internal successors, (58), 19 states have internal predecessors, (58), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-08 16:50:07,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:07,339 INFO L93 Difference]: Finished difference Result 3226 states and 4037 transitions. [2025-03-08 16:50:07,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 16:50:07,340 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 3.625) internal successors, (58), 19 states have internal predecessors, (58), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 5 states have call successors, (18) Word has length 145 [2025-03-08 16:50:07,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:07,345 INFO L225 Difference]: With dead ends: 3226 [2025-03-08 16:50:07,345 INFO L226 Difference]: Without dead ends: 1618 [2025-03-08 16:50:07,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=160, Invalid=962, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 16:50:07,348 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 386 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:07,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 862 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 16:50:07,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2025-03-08 16:50:07,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1601. [2025-03-08 16:50:07,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1408 states have (on average 1.2066761363636365) internal successors, (1699), 1425 states have internal predecessors, (1699), 152 states have call successors, (152), 40 states have call predecessors, (152), 40 states have return successors, (152), 135 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-08 16:50:07,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2003 transitions. [2025-03-08 16:50:07,413 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2003 transitions. Word has length 145 [2025-03-08 16:50:07,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:07,413 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2003 transitions. [2025-03-08 16:50:07,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 3.625) internal successors, (58), 19 states have internal predecessors, (58), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-08 16:50:07,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2003 transitions. [2025-03-08 16:50:07,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 16:50:07,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:07,414 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:07,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 16:50:07,414 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:07,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:07,415 INFO L85 PathProgramCache]: Analyzing trace with hash 739320050, now seen corresponding path program 1 times [2025-03-08 16:50:07,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:07,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105795088] [2025-03-08 16:50:07,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:07,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:07,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 16:50:07,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 16:50:07,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:07,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:50:09,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:09,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105795088] [2025-03-08 16:50:09,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105795088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:09,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:09,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 16:50:09,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358099835] [2025-03-08 16:50:09,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:09,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 16:50:09,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:09,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 16:50:09,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:50:09,231 INFO L87 Difference]: Start difference. First operand 1601 states and 2003 transitions. Second operand has 20 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:50:11,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:11,211 INFO L93 Difference]: Finished difference Result 2752 states and 3448 transitions. [2025-03-08 16:50:11,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 16:50:11,214 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 146 [2025-03-08 16:50:11,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:11,218 INFO L225 Difference]: With dead ends: 2752 [2025-03-08 16:50:11,218 INFO L226 Difference]: Without dead ends: 1652 [2025-03-08 16:50:11,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2025-03-08 16:50:11,222 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 247 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 1745 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 1760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:11,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1737 Invalid, 1760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1745 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 16:50:11,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2025-03-08 16:50:11,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1609. [2025-03-08 16:50:11,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1416 states have (on average 1.2055084745762712) internal successors, (1707), 1433 states have internal predecessors, (1707), 152 states have call successors, (152), 40 states have call predecessors, (152), 40 states have return successors, (152), 135 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-08 16:50:11,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2011 transitions. [2025-03-08 16:50:11,280 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2011 transitions. Word has length 146 [2025-03-08 16:50:11,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:11,281 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2011 transitions. [2025-03-08 16:50:11,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:50:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2011 transitions. [2025-03-08 16:50:11,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 16:50:11,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:11,282 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:11,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 16:50:11,283 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:11,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:11,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1517740760, now seen corresponding path program 1 times [2025-03-08 16:50:11,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:11,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765369417] [2025-03-08 16:50:11,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:11,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:11,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:50:11,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:50:11,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:11,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:13,639 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:50:13,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:13,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765369417] [2025-03-08 16:50:13,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765369417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:13,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:13,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-03-08 16:50:13,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32532098] [2025-03-08 16:50:13,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:13,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 16:50:13,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:13,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 16:50:13,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2025-03-08 16:50:13,640 INFO L87 Difference]: Start difference. First operand 1609 states and 2011 transitions. Second operand has 27 states, 24 states have (on average 2.5) internal successors, (60), 27 states have internal predecessors, (60), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:50:17,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:17,837 INFO L93 Difference]: Finished difference Result 1802 states and 2227 transitions. [2025-03-08 16:50:17,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-08 16:50:17,837 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.5) internal successors, (60), 27 states have internal predecessors, (60), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 147 [2025-03-08 16:50:17,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:17,842 INFO L225 Difference]: With dead ends: 1802 [2025-03-08 16:50:17,842 INFO L226 Difference]: Without dead ends: 1800 [2025-03-08 16:50:17,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=472, Invalid=4358, Unknown=0, NotChecked=0, Total=4830 [2025-03-08 16:50:17,844 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 411 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 2235 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:17,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1246 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2235 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 16:50:17,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2025-03-08 16:50:17,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1688. [2025-03-08 16:50:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1688 states, 1495 states have (on average 1.1959866220735786) internal successors, (1788), 1512 states have internal predecessors, (1788), 152 states have call successors, (152), 40 states have call predecessors, (152), 40 states have return successors, (152), 135 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-08 16:50:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1688 states and 2092 transitions. [2025-03-08 16:50:17,911 INFO L78 Accepts]: Start accepts. Automaton has 1688 states and 2092 transitions. Word has length 147 [2025-03-08 16:50:17,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:17,911 INFO L471 AbstractCegarLoop]: Abstraction has 1688 states and 2092 transitions. [2025-03-08 16:50:17,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.5) internal successors, (60), 27 states have internal predecessors, (60), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:50:17,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 2092 transitions. [2025-03-08 16:50:17,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 16:50:17,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:17,913 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:17,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 16:50:17,913 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:17,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:17,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1773697452, now seen corresponding path program 1 times [2025-03-08 16:50:17,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:17,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208697133] [2025-03-08 16:50:17,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:17,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:50:17,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:50:17,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:17,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:18,900 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:50:18,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:18,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208697133] [2025-03-08 16:50:18,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208697133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:18,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:18,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 16:50:18,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076854639] [2025-03-08 16:50:18,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:18,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:50:18,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:18,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:50:18,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:50:18,901 INFO L87 Difference]: Start difference. First operand 1688 states and 2092 transitions. Second operand has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:50:19,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:19,467 INFO L93 Difference]: Finished difference Result 3495 states and 4316 transitions. [2025-03-08 16:50:19,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 16:50:19,467 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 147 [2025-03-08 16:50:19,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:19,472 INFO L225 Difference]: With dead ends: 3495 [2025-03-08 16:50:19,472 INFO L226 Difference]: Without dead ends: 1810 [2025-03-08 16:50:19,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-03-08 16:50:19,474 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 101 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:19,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 773 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:50:19,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2025-03-08 16:50:19,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1716. [2025-03-08 16:50:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1523 states have (on average 1.1917268548916613) internal successors, (1815), 1540 states have internal predecessors, (1815), 152 states have call successors, (152), 40 states have call predecessors, (152), 40 states have return successors, (152), 135 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-08 16:50:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2119 transitions. [2025-03-08 16:50:19,539 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2119 transitions. Word has length 147 [2025-03-08 16:50:19,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:19,539 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 2119 transitions. [2025-03-08 16:50:19,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:50:19,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2119 transitions. [2025-03-08 16:50:19,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 16:50:19,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:19,540 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:19,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 16:50:19,541 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:19,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:19,541 INFO L85 PathProgramCache]: Analyzing trace with hash -272976279, now seen corresponding path program 1 times [2025-03-08 16:50:19,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:19,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077853105] [2025-03-08 16:50:19,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:19,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:19,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:50:19,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:50:19,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:19,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:19,628 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:50:19,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:19,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077853105] [2025-03-08 16:50:19,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077853105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:19,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:19,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:50:19,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968439888] [2025-03-08 16:50:19,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:19,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:50:19,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:19,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:50:19,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:50:19,630 INFO L87 Difference]: Start difference. First operand 1716 states and 2119 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:50:19,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:19,858 INFO L93 Difference]: Finished difference Result 4157 states and 5104 transitions. [2025-03-08 16:50:19,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:50:19,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-03-08 16:50:19,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:19,863 INFO L225 Difference]: With dead ends: 4157 [2025-03-08 16:50:19,863 INFO L226 Difference]: Without dead ends: 2444 [2025-03-08 16:50:19,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:50:19,866 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 59 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:19,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 420 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:50:19,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2025-03-08 16:50:19,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 2044. [2025-03-08 16:50:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 1830 states have (on average 1.1825136612021858) internal successors, (2164), 1849 states have internal predecessors, (2164), 168 states have call successors, (168), 45 states have call predecessors, (168), 45 states have return successors, (168), 149 states have call predecessors, (168), 168 states have call successors, (168) [2025-03-08 16:50:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2500 transitions. [2025-03-08 16:50:19,945 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2500 transitions. Word has length 147 [2025-03-08 16:50:19,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:19,945 INFO L471 AbstractCegarLoop]: Abstraction has 2044 states and 2500 transitions. [2025-03-08 16:50:19,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:50:19,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2500 transitions. [2025-03-08 16:50:19,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:50:19,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:19,946 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:19,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 16:50:19,947 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:19,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:19,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1906803477, now seen corresponding path program 1 times [2025-03-08 16:50:19,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:19,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121790390] [2025-03-08 16:50:19,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:19,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:19,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:50:19,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:50:19,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:19,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:50:20,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:20,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121790390] [2025-03-08 16:50:20,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121790390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:20,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:20,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:50:20,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665452111] [2025-03-08 16:50:20,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:20,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:50:20,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:20,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:50:20,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:50:20,820 INFO L87 Difference]: Start difference. First operand 2044 states and 2500 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:50:21,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:21,163 INFO L93 Difference]: Finished difference Result 4172 states and 5099 transitions. [2025-03-08 16:50:21,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:50:21,164 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 148 [2025-03-08 16:50:21,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:21,169 INFO L225 Difference]: With dead ends: 4172 [2025-03-08 16:50:21,169 INFO L226 Difference]: Without dead ends: 2131 [2025-03-08 16:50:21,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:50:21,172 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 35 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:21,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 611 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:50:21,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2025-03-08 16:50:21,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 1886. [2025-03-08 16:50:21,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1672 states have (on average 1.1776315789473684) internal successors, (1969), 1691 states have internal predecessors, (1969), 168 states have call successors, (168), 45 states have call predecessors, (168), 45 states have return successors, (168), 149 states have call predecessors, (168), 168 states have call successors, (168) [2025-03-08 16:50:21,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2305 transitions. [2025-03-08 16:50:21,250 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2305 transitions. Word has length 148 [2025-03-08 16:50:21,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:21,250 INFO L471 AbstractCegarLoop]: Abstraction has 1886 states and 2305 transitions. [2025-03-08 16:50:21,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:50:21,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2305 transitions. [2025-03-08 16:50:21,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:50:21,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:21,252 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:21,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 16:50:21,252 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:21,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:21,252 INFO L85 PathProgramCache]: Analyzing trace with hash -316003409, now seen corresponding path program 1 times [2025-03-08 16:50:21,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:21,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721440624] [2025-03-08 16:50:21,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:21,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:21,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:50:21,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:50:21,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:21,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:22,562 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:50:22,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:22,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721440624] [2025-03-08 16:50:22,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721440624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:22,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:22,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 16:50:22,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125326668] [2025-03-08 16:50:22,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:22,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 16:50:22,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:22,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 16:50:22,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:50:22,563 INFO L87 Difference]: Start difference. First operand 1886 states and 2305 transitions. Second operand has 16 states, 12 states have (on average 5.083333333333333) internal successors, (61), 16 states have internal predecessors, (61), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-08 16:50:23,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:23,622 INFO L93 Difference]: Finished difference Result 4029 states and 4900 transitions. [2025-03-08 16:50:23,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 16:50:23,622 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 5.083333333333333) internal successors, (61), 16 states have internal predecessors, (61), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 5 states have call successors, (18) Word has length 148 [2025-03-08 16:50:23,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:23,628 INFO L225 Difference]: With dead ends: 4029 [2025-03-08 16:50:23,628 INFO L226 Difference]: Without dead ends: 2146 [2025-03-08 16:50:23,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2025-03-08 16:50:23,631 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 157 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:23,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1445 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 16:50:23,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2025-03-08 16:50:23,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2053. [2025-03-08 16:50:23,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 1821 states have (on average 1.1696869851729819) internal successors, (2130), 1842 states have internal predecessors, (2130), 180 states have call successors, (180), 51 states have call predecessors, (180), 51 states have return successors, (180), 159 states have call predecessors, (180), 180 states have call successors, (180) [2025-03-08 16:50:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 2490 transitions. [2025-03-08 16:50:23,725 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 2490 transitions. Word has length 148 [2025-03-08 16:50:23,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:23,726 INFO L471 AbstractCegarLoop]: Abstraction has 2053 states and 2490 transitions. [2025-03-08 16:50:23,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 5.083333333333333) internal successors, (61), 16 states have internal predecessors, (61), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-08 16:50:23,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2490 transitions. [2025-03-08 16:50:23,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:50:23,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:23,728 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:23,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 16:50:23,729 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:23,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:23,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1497343756, now seen corresponding path program 1 times [2025-03-08 16:50:23,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:23,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113962143] [2025-03-08 16:50:23,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:23,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:23,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:50:23,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:50:23,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:23,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:50:24,578 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:50:24,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:50:24,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113962143] [2025-03-08 16:50:24,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113962143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:50:24,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:50:24,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:50:24,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127205900] [2025-03-08 16:50:24,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:50:24,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:50:24,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:50:24,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:50:24,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:50:24,579 INFO L87 Difference]: Start difference. First operand 2053 states and 2490 transitions. Second operand has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:50:24,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:50:24,887 INFO L93 Difference]: Finished difference Result 3690 states and 4482 transitions. [2025-03-08 16:50:24,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:50:24,888 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 148 [2025-03-08 16:50:24,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:50:24,893 INFO L225 Difference]: With dead ends: 3690 [2025-03-08 16:50:24,893 INFO L226 Difference]: Without dead ends: 2330 [2025-03-08 16:50:24,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:50:24,895 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 75 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:50:24,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 672 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:50:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2025-03-08 16:50:24,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2133. [2025-03-08 16:50:24,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 1901 states have (on average 1.1709626512361915) internal successors, (2226), 1922 states have internal predecessors, (2226), 180 states have call successors, (180), 51 states have call predecessors, (180), 51 states have return successors, (180), 159 states have call predecessors, (180), 180 states have call successors, (180) [2025-03-08 16:50:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2586 transitions. [2025-03-08 16:50:24,990 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2586 transitions. Word has length 148 [2025-03-08 16:50:24,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:50:24,990 INFO L471 AbstractCegarLoop]: Abstraction has 2133 states and 2586 transitions. [2025-03-08 16:50:24,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:50:24,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2586 transitions. [2025-03-08 16:50:24,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:50:24,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:50:24,992 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:50:24,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 16:50:24,992 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:50:24,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:50:24,993 INFO L85 PathProgramCache]: Analyzing trace with hash -211871601, now seen corresponding path program 1 times [2025-03-08 16:50:24,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:50:24,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686831036] [2025-03-08 16:50:24,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:50:24,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:50:25,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:50:25,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:50:25,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:50:25,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat