./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-ap_file-27.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 1ed18464d9ce97d1cc1f49d30a31556076037dce4eff04ef8ec5de65e115e002 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:32:49,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:32:49,653 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:32:49,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:32:49,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:32:49,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:32:49,679 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:32:49,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:32:49,680 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:32:49,680 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:32:49,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:32:49,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:32:49,681 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:32:49,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:32:49,681 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:32:49,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:32:49,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:32:49,682 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:32:49,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:32:49,682 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:32:49,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:32:49,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:32:49,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:32:49,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:32:49,682 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:32:49,682 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:32:49,682 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:32:49,682 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:32:49,683 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:32:49,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:32:49,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:32:49,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:32:49,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:32:49,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:32:49,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:32:49,683 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:32:49,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:32:49,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:32:49,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:32:49,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:32:49,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:32:49,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:32:49,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:32:49,684 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 -> 1ed18464d9ce97d1cc1f49d30a31556076037dce4eff04ef8ec5de65e115e002 [2025-03-17 05:32:49,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:32:49,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:32:49,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:32:49,988 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:32:49,989 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:32:49,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-27.i [2025-03-17 05:32:51,239 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93279b5a8/c4def475695b40c38de5d08b30a960a1/FLAG1d5fc101b [2025-03-17 05:32:51,538 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:32:51,540 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-27.i [2025-03-17 05:32:51,549 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93279b5a8/c4def475695b40c38de5d08b30a960a1/FLAG1d5fc101b [2025-03-17 05:32:51,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93279b5a8/c4def475695b40c38de5d08b30a960a1 [2025-03-17 05:32:51,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:32:51,808 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:32:51,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:32:51,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:32:51,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:32:51,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:32:51" (1/1) ... [2025-03-17 05:32:51,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73707474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:51, skipping insertion in model container [2025-03-17 05:32:51,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:32:51" (1/1) ... [2025-03-17 05:32:51,836 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:32:51,962 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-ap_file-27.i[917,930] [2025-03-17 05:32:52,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:32:52,040 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:32:52,047 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-ap_file-27.i[917,930] [2025-03-17 05:32:52,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:32:52,090 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:32:52,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:52 WrapperNode [2025-03-17 05:32:52,091 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:32:52,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:32:52,092 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:32:52,092 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:32:52,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:52" (1/1) ... [2025-03-17 05:32:52,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:52" (1/1) ... [2025-03-17 05:32:52,147 INFO L138 Inliner]: procedures = 26, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 442 [2025-03-17 05:32:52,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:32:52,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:32:52,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:32:52,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:32:52,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:52" (1/1) ... [2025-03-17 05:32:52,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:52" (1/1) ... [2025-03-17 05:32:52,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:52" (1/1) ... [2025-03-17 05:32:52,183 INFO L175 MemorySlicer]: Split 123 memory accesses to 5 slices as follows [2, 16, 70, 11, 24]. 57 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 6, 1, 3]. The 16 writes are split as follows [0, 2, 8, 1, 5]. [2025-03-17 05:32:52,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:52" (1/1) ... [2025-03-17 05:32:52,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:52" (1/1) ... [2025-03-17 05:32:52,200 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:52" (1/1) ... [2025-03-17 05:32:52,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:52" (1/1) ... [2025-03-17 05:32:52,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:52" (1/1) ... [2025-03-17 05:32:52,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:52" (1/1) ... [2025-03-17 05:32:52,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:32:52,214 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:32:52,214 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:32:52,214 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:32:52,214 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:52" (1/1) ... [2025-03-17 05:32:52,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:32:52,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:32:52,256 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-17 05:32:52,258 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-17 05:32:52,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:32:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:32:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:32:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:32:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:32:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:32:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:32:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:32:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:32:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:32:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:32:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:32:52,277 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:32:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:32:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:32:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:32:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:32:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:32:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:32:52,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:32:52,405 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:32:52,407 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:32:52,825 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~mem67#1;havoc property_#t~ite80#1;havoc property_#t~mem76#1;havoc property_#t~mem75#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem70#1;havoc property_#t~ite74#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~short83#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~short88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~ite100#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem91#1;havoc property_#t~ite93#1;havoc property_#t~mem92#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~ite120#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite111#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~ite117#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~short121#1; [2025-03-17 05:32:52,868 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2025-03-17 05:32:52,868 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:32:52,880 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:32:52,881 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:32:52,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:32:52 BoogieIcfgContainer [2025-03-17 05:32:52,881 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:32:52,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:32:52,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:32:52,887 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:32:52,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:32:51" (1/3) ... [2025-03-17 05:32:52,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ba0cb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:32:52, skipping insertion in model container [2025-03-17 05:32:52,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:52" (2/3) ... [2025-03-17 05:32:52,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ba0cb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:32:52, skipping insertion in model container [2025-03-17 05:32:52,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:32:52" (3/3) ... [2025-03-17 05:32:52,890 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-27.i [2025-03-17 05:32:52,902 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:32:52,903 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-27.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:32:52,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:32:52,951 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;@7def8f9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:32:52,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:32:52,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 69 states have internal predecessors, (95), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:32:52,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:32:52,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:52,964 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:32:52,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:52,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:52,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1538753743, now seen corresponding path program 1 times [2025-03-17 05:32:52,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:52,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500744217] [2025-03-17 05:32:52,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:52,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:53,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:32:53,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:32:53,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:53,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:53,227 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 05:32:53,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:53,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500744217] [2025-03-17 05:32:53,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500744217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:32:53,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780365911] [2025-03-17 05:32:53,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:53,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:32:53,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:32:53,233 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-17 05:32:53,238 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-17 05:32:53,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:32:53,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:32:53,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:53,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:53,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:32:53,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:32:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 05:32:53,479 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:32:53,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780365911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:32:53,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:32:53,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:32:53,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657044379] [2025-03-17 05:32:53,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:32:53,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:32:53,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:53,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:32:53,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:32:53,502 INFO L87 Difference]: Start difference. First operand has 88 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 69 states have internal predecessors, (95), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:32:53,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:53,521 INFO L93 Difference]: Finished difference Result 173 states and 273 transitions. [2025-03-17 05:32:53,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:32:53,523 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 127 [2025-03-17 05:32:53,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:53,528 INFO L225 Difference]: With dead ends: 173 [2025-03-17 05:32:53,528 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 05:32:53,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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-17 05:32:53,534 INFO L435 NwaCegarLoop]: 125 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, 125 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-17 05:32:53,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:32:53,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 05:32:53,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-17 05:32:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:32:53,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 125 transitions. [2025-03-17 05:32:53,567 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 125 transitions. Word has length 127 [2025-03-17 05:32:53,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:53,567 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 125 transitions. [2025-03-17 05:32:53,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:32:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 125 transitions. [2025-03-17 05:32:53,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:32:53,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:53,571 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:32:53,579 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-17 05:32:53,772 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-17 05:32:53,772 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:53,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:53,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2073879648, now seen corresponding path program 1 times [2025-03-17 05:32:53,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:53,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144008006] [2025-03-17 05:32:53,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:53,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:53,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:32:53,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:32:53,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:53,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:32:54,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:54,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144008006] [2025-03-17 05:32:54,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144008006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:32:54,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:32:54,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:32:54,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602105947] [2025-03-17 05:32:54,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:32:54,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:32:54,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:54,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:32:54,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:32:54,437 INFO L87 Difference]: Start difference. First operand 86 states and 125 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:32:54,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:54,525 INFO L93 Difference]: Finished difference Result 217 states and 317 transitions. [2025-03-17 05:32:54,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:32:54,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 127 [2025-03-17 05:32:54,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:54,527 INFO L225 Difference]: With dead ends: 217 [2025-03-17 05:32:54,527 INFO L226 Difference]: Without dead ends: 132 [2025-03-17 05:32:54,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:32:54,528 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 129 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:32:54,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 335 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:32:54,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-17 05:32:54,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 90. [2025-03-17 05:32:54,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 71 states have internal predecessors, (97), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:32:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2025-03-17 05:32:54,569 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 127 [2025-03-17 05:32:54,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:54,570 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2025-03-17 05:32:54,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:32:54,571 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2025-03-17 05:32:54,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:32:54,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:54,573 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:32:54,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:32:54,573 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:54,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:54,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1376615777, now seen corresponding path program 1 times [2025-03-17 05:32:54,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:54,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087086648] [2025-03-17 05:32:54,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:54,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:54,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:32:54,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:32:54,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:54,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:32:55,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:55,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087086648] [2025-03-17 05:32:55,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087086648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:32:55,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:32:55,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:32:55,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824019177] [2025-03-17 05:32:55,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:32:55,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:32:55,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:55,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:32:55,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:32:55,173 INFO L87 Difference]: Start difference. First operand 90 states and 131 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:32:55,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:55,302 INFO L93 Difference]: Finished difference Result 233 states and 340 transitions. [2025-03-17 05:32:55,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:32:55,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 127 [2025-03-17 05:32:55,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:55,304 INFO L225 Difference]: With dead ends: 233 [2025-03-17 05:32:55,306 INFO L226 Difference]: Without dead ends: 144 [2025-03-17 05:32:55,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:32:55,307 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 60 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:32:55,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 297 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:32:55,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-17 05:32:55,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2025-03-17 05:32:55,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:32:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 203 transitions. [2025-03-17 05:32:55,329 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 203 transitions. Word has length 127 [2025-03-17 05:32:55,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:55,329 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 203 transitions. [2025-03-17 05:32:55,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:32:55,330 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 203 transitions. [2025-03-17 05:32:55,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:32:55,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:55,332 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:32:55,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:32:55,333 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:55,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:55,333 INFO L85 PathProgramCache]: Analyzing trace with hash -829115167, now seen corresponding path program 1 times [2025-03-17 05:32:55,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:55,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880890519] [2025-03-17 05:32:55,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:55,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:55,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:32:55,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:32:55,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:55,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:32:55,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:55,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880890519] [2025-03-17 05:32:55,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880890519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:32:55,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:32:55,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:32:55,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379331543] [2025-03-17 05:32:55,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:32:55,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:32:55,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:55,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:32:55,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:32:55,631 INFO L87 Difference]: Start difference. First operand 140 states and 203 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:32:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:55,700 INFO L93 Difference]: Finished difference Result 279 states and 404 transitions. [2025-03-17 05:32:55,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:32:55,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 127 [2025-03-17 05:32:55,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:55,703 INFO L225 Difference]: With dead ends: 279 [2025-03-17 05:32:55,705 INFO L226 Difference]: Without dead ends: 190 [2025-03-17 05:32:55,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:32:55,706 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 116 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:32:55,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 449 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:32:55,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-17 05:32:55,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 158. [2025-03-17 05:32:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 121 states have internal predecessors, (159), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:32:55,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 227 transitions. [2025-03-17 05:32:55,728 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 227 transitions. Word has length 127 [2025-03-17 05:32:55,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:55,728 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 227 transitions. [2025-03-17 05:32:55,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:32:55,729 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 227 transitions. [2025-03-17 05:32:55,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 05:32:55,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:55,730 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:32:55,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:32:55,730 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:55,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:55,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1407117655, now seen corresponding path program 1 times [2025-03-17 05:32:55,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:55,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108914311] [2025-03-17 05:32:55,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:55,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:55,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:32:55,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:32:55,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:55,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:32:57,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:57,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108914311] [2025-03-17 05:32:57,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108914311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:32:57,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:32:57,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:32:57,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463236958] [2025-03-17 05:32:57,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:32:57,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:32:57,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:57,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:32:57,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:32:57,115 INFO L87 Difference]: Start difference. First operand 158 states and 227 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:32:57,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:57,771 INFO L93 Difference]: Finished difference Result 322 states and 461 transitions. [2025-03-17 05:32:57,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:32:57,772 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 128 [2025-03-17 05:32:57,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:57,774 INFO L225 Difference]: With dead ends: 322 [2025-03-17 05:32:57,774 INFO L226 Difference]: Without dead ends: 220 [2025-03-17 05:32:57,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:32:57,775 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 208 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:32:57,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 478 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:32:57,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-17 05:32:57,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 213. [2025-03-17 05:32:57,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 171 states have (on average 1.327485380116959) internal successors, (227), 172 states have internal predecessors, (227), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:32:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 303 transitions. [2025-03-17 05:32:57,808 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 303 transitions. Word has length 128 [2025-03-17 05:32:57,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:57,808 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 303 transitions. [2025-03-17 05:32:57,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:32:57,810 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 303 transitions. [2025-03-17 05:32:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 05:32:57,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:57,813 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:32:57,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:32:57,813 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:57,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:57,814 INFO L85 PathProgramCache]: Analyzing trace with hash 100434154, now seen corresponding path program 1 times [2025-03-17 05:32:57,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:57,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063726211] [2025-03-17 05:32:57,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:57,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:57,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:32:57,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:32:57,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:57,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:59,077 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:32:59,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:59,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063726211] [2025-03-17 05:32:59,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063726211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:32:59,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:32:59,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:32:59,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684426041] [2025-03-17 05:32:59,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:32:59,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:32:59,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:59,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:32:59,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:32:59,078 INFO L87 Difference]: Start difference. First operand 213 states and 303 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:32:59,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:59,643 INFO L93 Difference]: Finished difference Result 426 states and 605 transitions. [2025-03-17 05:32:59,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:32:59,643 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 128 [2025-03-17 05:32:59,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:59,646 INFO L225 Difference]: With dead ends: 426 [2025-03-17 05:32:59,646 INFO L226 Difference]: Without dead ends: 269 [2025-03-17 05:32:59,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:32:59,649 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 353 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:32:59,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 632 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:32:59,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-17 05:32:59,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 219. [2025-03-17 05:32:59,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 177 states have (on average 1.3276836158192091) internal successors, (235), 178 states have internal predecessors, (235), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:32:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 311 transitions. [2025-03-17 05:32:59,681 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 311 transitions. Word has length 128 [2025-03-17 05:32:59,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:59,682 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 311 transitions. [2025-03-17 05:32:59,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:32:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 311 transitions. [2025-03-17 05:32:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 05:32:59,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:59,683 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:32:59,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:32:59,683 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:59,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:59,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2033707551, now seen corresponding path program 1 times [2025-03-17 05:32:59,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:59,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067081848] [2025-03-17 05:32:59,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:59,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:59,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 05:32:59,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 05:32:59,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:59,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:00,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:00,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067081848] [2025-03-17 05:33:00,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067081848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:00,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:00,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:33:00,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469731966] [2025-03-17 05:33:00,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:00,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:33:00,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:00,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:33:00,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:33:00,141 INFO L87 Difference]: Start difference. First operand 219 states and 311 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:33:00,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:00,370 INFO L93 Difference]: Finished difference Result 535 states and 763 transitions. [2025-03-17 05:33:00,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:33:00,371 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 129 [2025-03-17 05:33:00,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:00,374 INFO L225 Difference]: With dead ends: 535 [2025-03-17 05:33:00,374 INFO L226 Difference]: Without dead ends: 372 [2025-03-17 05:33:00,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:33:00,375 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 153 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:00,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 363 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:33:00,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-17 05:33:00,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 364. [2025-03-17 05:33:00,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 299 states have (on average 1.3444816053511706) internal successors, (402), 301 states have internal predecessors, (402), 59 states have call successors, (59), 5 states have call predecessors, (59), 5 states have return successors, (59), 57 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-17 05:33:00,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 520 transitions. [2025-03-17 05:33:00,424 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 520 transitions. Word has length 129 [2025-03-17 05:33:00,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:00,425 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 520 transitions. [2025-03-17 05:33:00,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:33:00,425 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 520 transitions. [2025-03-17 05:33:00,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:33:00,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:00,427 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:00,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:33:00,427 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:00,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:00,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1664462489, now seen corresponding path program 1 times [2025-03-17 05:33:00,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:00,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201636759] [2025-03-17 05:33:00,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:00,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:00,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:33:00,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:33:00,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:00,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:00,891 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:00,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:00,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201636759] [2025-03-17 05:33:00,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201636759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:00,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:00,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:33:00,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102310909] [2025-03-17 05:33:00,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:00,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:33:00,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:00,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:33:00,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:33:00,894 INFO L87 Difference]: Start difference. First operand 364 states and 520 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:33:01,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:01,243 INFO L93 Difference]: Finished difference Result 543 states and 764 transitions. [2025-03-17 05:33:01,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:33:01,243 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2025-03-17 05:33:01,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:01,245 INFO L225 Difference]: With dead ends: 543 [2025-03-17 05:33:01,245 INFO L226 Difference]: Without dead ends: 380 [2025-03-17 05:33:01,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:33:01,246 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 229 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:01,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 450 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:33:01,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-17 05:33:01,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 289. [2025-03-17 05:33:01,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 231 states have (on average 1.3116883116883118) internal successors, (303), 231 states have internal predecessors, (303), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 05:33:01,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 405 transitions. [2025-03-17 05:33:01,279 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 405 transitions. Word has length 130 [2025-03-17 05:33:01,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:01,279 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 405 transitions. [2025-03-17 05:33:01,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:33:01,280 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 405 transitions. [2025-03-17 05:33:01,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:33:01,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:01,281 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:01,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:33:01,281 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:01,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:01,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1959808296, now seen corresponding path program 1 times [2025-03-17 05:33:01,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:01,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800853951] [2025-03-17 05:33:01,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:01,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:01,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:33:01,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:33:01,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:01,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:01,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:01,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800853951] [2025-03-17 05:33:01,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800853951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:01,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:01,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:33:01,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722606463] [2025-03-17 05:33:01,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:01,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:33:01,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:01,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:33:01,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:33:01,655 INFO L87 Difference]: Start difference. First operand 289 states and 405 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:33:01,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:01,935 INFO L93 Difference]: Finished difference Result 566 states and 793 transitions. [2025-03-17 05:33:01,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:33:01,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2025-03-17 05:33:01,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:01,940 INFO L225 Difference]: With dead ends: 566 [2025-03-17 05:33:01,940 INFO L226 Difference]: Without dead ends: 326 [2025-03-17 05:33:01,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:33:01,941 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 196 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:01,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 328 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:33:01,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-17 05:33:01,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 230. [2025-03-17 05:33:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 191 states have (on average 1.324607329842932) internal successors, (253), 191 states have internal predecessors, (253), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:33:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 321 transitions. [2025-03-17 05:33:01,980 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 321 transitions. Word has length 130 [2025-03-17 05:33:01,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:01,981 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 321 transitions. [2025-03-17 05:33:01,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:33:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 321 transitions. [2025-03-17 05:33:01,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:33:01,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:01,984 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:01,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:33:01,984 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:01,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:01,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1044870098, now seen corresponding path program 1 times [2025-03-17 05:33:01,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:01,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931550492] [2025-03-17 05:33:01,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:01,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:02,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:33:02,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:33:02,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:02,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:03,623 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:03,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:03,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931550492] [2025-03-17 05:33:03,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931550492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:03,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:03,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 05:33:03,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893877970] [2025-03-17 05:33:03,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:03,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:33:03,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:03,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:33:03,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:33:03,625 INFO L87 Difference]: Start difference. First operand 230 states and 321 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:33:04,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:04,860 INFO L93 Difference]: Finished difference Result 695 states and 964 transitions. [2025-03-17 05:33:04,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:33:04,860 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 131 [2025-03-17 05:33:04,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:04,863 INFO L225 Difference]: With dead ends: 695 [2025-03-17 05:33:04,863 INFO L226 Difference]: Without dead ends: 466 [2025-03-17 05:33:04,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=585, Unknown=0, NotChecked=0, Total=756 [2025-03-17 05:33:04,864 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 379 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:04,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 713 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:33:04,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-03-17 05:33:04,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 319. [2025-03-17 05:33:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 280 states have (on average 1.3357142857142856) internal successors, (374), 280 states have internal predecessors, (374), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:33:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 442 transitions. [2025-03-17 05:33:04,911 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 442 transitions. Word has length 131 [2025-03-17 05:33:04,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:04,911 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 442 transitions. [2025-03-17 05:33:04,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:33:04,911 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 442 transitions. [2025-03-17 05:33:04,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:33:04,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:04,913 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:04,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:33:04,913 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:04,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:04,914 INFO L85 PathProgramCache]: Analyzing trace with hash 114703645, now seen corresponding path program 1 times [2025-03-17 05:33:04,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:04,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640509510] [2025-03-17 05:33:04,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:04,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:04,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:33:05,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:33:05,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:05,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:06,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:06,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640509510] [2025-03-17 05:33:06,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640509510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:06,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:06,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:33:06,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122143158] [2025-03-17 05:33:06,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:06,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:33:06,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:06,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:33:06,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:33:06,020 INFO L87 Difference]: Start difference. First operand 319 states and 442 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:33:06,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:06,911 INFO L93 Difference]: Finished difference Result 799 states and 1104 transitions. [2025-03-17 05:33:06,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:33:06,912 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 131 [2025-03-17 05:33:06,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:06,914 INFO L225 Difference]: With dead ends: 799 [2025-03-17 05:33:06,914 INFO L226 Difference]: Without dead ends: 481 [2025-03-17 05:33:06,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:33:06,918 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 186 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:06,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 838 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:33:06,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-17 05:33:06,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 383. [2025-03-17 05:33:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 344 states have (on average 1.3313953488372092) internal successors, (458), 344 states have internal predecessors, (458), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:33:06,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 526 transitions. [2025-03-17 05:33:06,972 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 526 transitions. Word has length 131 [2025-03-17 05:33:06,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:06,972 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 526 transitions. [2025-03-17 05:33:06,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:33:06,972 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 526 transitions. [2025-03-17 05:33:06,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:33:06,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:06,978 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:06,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:33:06,978 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:06,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:06,978 INFO L85 PathProgramCache]: Analyzing trace with hash 243786364, now seen corresponding path program 1 times [2025-03-17 05:33:06,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:06,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217960358] [2025-03-17 05:33:06,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:06,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:06,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:33:07,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:33:07,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:07,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:07,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:07,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217960358] [2025-03-17 05:33:07,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217960358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:07,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:07,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:33:07,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475164163] [2025-03-17 05:33:07,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:07,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:33:07,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:07,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:33:07,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:33:07,608 INFO L87 Difference]: Start difference. First operand 383 states and 526 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:33:08,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:08,088 INFO L93 Difference]: Finished difference Result 851 states and 1168 transitions. [2025-03-17 05:33:08,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:33:08,089 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2025-03-17 05:33:08,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:08,091 INFO L225 Difference]: With dead ends: 851 [2025-03-17 05:33:08,091 INFO L226 Difference]: Without dead ends: 469 [2025-03-17 05:33:08,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:33:08,093 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 211 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:08,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 505 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:33:08,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-17 05:33:08,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 383. [2025-03-17 05:33:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 344 states have (on average 1.319767441860465) internal successors, (454), 344 states have internal predecessors, (454), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:33:08,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 522 transitions. [2025-03-17 05:33:08,130 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 522 transitions. Word has length 131 [2025-03-17 05:33:08,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:08,130 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 522 transitions. [2025-03-17 05:33:08,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:33:08,130 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 522 transitions. [2025-03-17 05:33:08,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:33:08,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:08,133 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:08,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:33:08,133 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:08,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:08,134 INFO L85 PathProgramCache]: Analyzing trace with hash -294120580, now seen corresponding path program 1 times [2025-03-17 05:33:08,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:08,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814078522] [2025-03-17 05:33:08,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:08,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:08,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:33:08,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:33:08,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:08,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:08,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:08,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814078522] [2025-03-17 05:33:08,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814078522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:08,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:08,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:33:08,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676341661] [2025-03-17 05:33:08,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:08,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:33:08,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:08,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:33:08,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:33:08,811 INFO L87 Difference]: Start difference. First operand 383 states and 522 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:33:09,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:09,350 INFO L93 Difference]: Finished difference Result 847 states and 1156 transitions. [2025-03-17 05:33:09,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:33:09,350 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2025-03-17 05:33:09,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:09,352 INFO L225 Difference]: With dead ends: 847 [2025-03-17 05:33:09,352 INFO L226 Difference]: Without dead ends: 465 [2025-03-17 05:33:09,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:33:09,354 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 179 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:09,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 532 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:33:09,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-17 05:33:09,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 383. [2025-03-17 05:33:09,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 344 states have (on average 1.308139534883721) internal successors, (450), 344 states have internal predecessors, (450), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:33:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 518 transitions. [2025-03-17 05:33:09,386 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 518 transitions. Word has length 131 [2025-03-17 05:33:09,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:09,386 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 518 transitions. [2025-03-17 05:33:09,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:33:09,386 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 518 transitions. [2025-03-17 05:33:09,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:33:09,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:09,388 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:09,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:33:09,388 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:09,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:09,389 INFO L85 PathProgramCache]: Analyzing trace with hash -165037861, now seen corresponding path program 1 times [2025-03-17 05:33:09,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:09,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667938345] [2025-03-17 05:33:09,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:09,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:09,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:33:09,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:33:09,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:09,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:09,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:09,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667938345] [2025-03-17 05:33:09,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667938345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:09,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:09,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:33:09,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087114325] [2025-03-17 05:33:09,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:09,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:33:09,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:09,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:33:09,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:33:09,960 INFO L87 Difference]: Start difference. First operand 383 states and 518 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:33:10,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:10,563 INFO L93 Difference]: Finished difference Result 847 states and 1148 transitions. [2025-03-17 05:33:10,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:33:10,563 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 131 [2025-03-17 05:33:10,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:10,567 INFO L225 Difference]: With dead ends: 847 [2025-03-17 05:33:10,567 INFO L226 Difference]: Without dead ends: 465 [2025-03-17 05:33:10,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:33:10,568 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 296 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:10,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 955 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:33:10,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-17 05:33:10,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 371. [2025-03-17 05:33:10,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 332 states have (on average 1.3072289156626506) internal successors, (434), 332 states have internal predecessors, (434), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:33:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 502 transitions. [2025-03-17 05:33:10,604 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 502 transitions. Word has length 131 [2025-03-17 05:33:10,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:10,604 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 502 transitions. [2025-03-17 05:33:10,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:33:10,604 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 502 transitions. [2025-03-17 05:33:10,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:33:10,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:10,605 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:10,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:33:10,606 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:10,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:10,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1075889905, now seen corresponding path program 1 times [2025-03-17 05:33:10,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:10,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809888843] [2025-03-17 05:33:10,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:10,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:10,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:33:10,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:33:10,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:10,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:10,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:10,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809888843] [2025-03-17 05:33:10,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809888843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:10,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:10,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:33:10,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868812556] [2025-03-17 05:33:10,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:10,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:33:10,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:10,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:33:10,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:33:10,754 INFO L87 Difference]: Start difference. First operand 371 states and 502 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:10,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:10,826 INFO L93 Difference]: Finished difference Result 787 states and 1066 transitions. [2025-03-17 05:33:10,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:33:10,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2025-03-17 05:33:10,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:10,830 INFO L225 Difference]: With dead ends: 787 [2025-03-17 05:33:10,830 INFO L226 Difference]: Without dead ends: 417 [2025-03-17 05:33:10,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:33:10,832 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 50 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:10,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 523 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:33:10,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-17 05:33:10,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 373. [2025-03-17 05:33:10,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 334 states have (on average 1.3053892215568863) internal successors, (436), 334 states have internal predecessors, (436), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:33:10,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 504 transitions. [2025-03-17 05:33:10,862 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 504 transitions. Word has length 131 [2025-03-17 05:33:10,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:10,862 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 504 transitions. [2025-03-17 05:33:10,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:10,863 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 504 transitions. [2025-03-17 05:33:10,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:33:10,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:10,864 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:10,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:33:10,864 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:10,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:10,864 INFO L85 PathProgramCache]: Analyzing trace with hash -721061454, now seen corresponding path program 1 times [2025-03-17 05:33:10,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:10,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268210692] [2025-03-17 05:33:10,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:10,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:10,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:33:10,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:33:10,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:10,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:11,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:11,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268210692] [2025-03-17 05:33:11,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268210692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:11,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:11,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:33:11,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416757549] [2025-03-17 05:33:11,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:11,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:33:11,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:11,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:33:11,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:33:11,028 INFO L87 Difference]: Start difference. First operand 373 states and 504 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:11,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:11,110 INFO L93 Difference]: Finished difference Result 810 states and 1092 transitions. [2025-03-17 05:33:11,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:33:11,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2025-03-17 05:33:11,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:11,113 INFO L225 Difference]: With dead ends: 810 [2025-03-17 05:33:11,113 INFO L226 Difference]: Without dead ends: 438 [2025-03-17 05:33:11,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:33:11,114 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 99 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:11,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 343 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:33:11,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-17 05:33:11,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 392. [2025-03-17 05:33:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 353 states have (on average 1.2861189801699717) internal successors, (454), 353 states have internal predecessors, (454), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:33:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 522 transitions. [2025-03-17 05:33:11,152 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 522 transitions. Word has length 131 [2025-03-17 05:33:11,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:11,153 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 522 transitions. [2025-03-17 05:33:11,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:11,153 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 522 transitions. [2025-03-17 05:33:11,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:33:11,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:11,154 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:11,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:33:11,155 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:11,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:11,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1990454827, now seen corresponding path program 1 times [2025-03-17 05:33:11,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:11,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012802218] [2025-03-17 05:33:11,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:11,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:11,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:33:11,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:33:11,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:11,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:11,271 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:33:11,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:11,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012802218] [2025-03-17 05:33:11,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012802218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:33:11,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037112054] [2025-03-17 05:33:11,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:11,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:33:11,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:33:11,274 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-17 05:33:11,275 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-17 05:33:11,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:33:11,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:33:11,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:11,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:11,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:33:11,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:33:11,468 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:11,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:33:11,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037112054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:11,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:33:11,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-17 05:33:11,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602178076] [2025-03-17 05:33:11,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:11,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:33:11,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:11,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:33:11,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:33:11,471 INFO L87 Difference]: Start difference. First operand 392 states and 522 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:11,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:11,534 INFO L93 Difference]: Finished difference Result 791 states and 1053 transitions. [2025-03-17 05:33:11,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:33:11,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-03-17 05:33:11,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:11,536 INFO L225 Difference]: With dead ends: 791 [2025-03-17 05:33:11,536 INFO L226 Difference]: Without dead ends: 400 [2025-03-17 05:33:11,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:33:11,538 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:11,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 576 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:33:11,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-17 05:33:11,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-03-17 05:33:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 361 states have (on average 1.2797783933518005) internal successors, (462), 361 states have internal predecessors, (462), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:33:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 530 transitions. [2025-03-17 05:33:11,579 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 530 transitions. Word has length 135 [2025-03-17 05:33:11,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:11,579 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 530 transitions. [2025-03-17 05:33:11,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 530 transitions. [2025-03-17 05:33:11,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:33:11,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:11,581 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:11,590 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-17 05:33:11,785 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,SelfDestructingSolverStorable16 [2025-03-17 05:33:11,785 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:11,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:11,786 INFO L85 PathProgramCache]: Analyzing trace with hash -497058006, now seen corresponding path program 1 times [2025-03-17 05:33:11,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:11,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977592834] [2025-03-17 05:33:11,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:11,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:11,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:33:11,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:33:11,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:11,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:12,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:12,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977592834] [2025-03-17 05:33:12,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977592834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:12,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:12,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:33:12,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291440624] [2025-03-17 05:33:12,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:12,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:33:12,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:12,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:33:12,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:33:12,010 INFO L87 Difference]: Start difference. First operand 400 states and 530 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:12,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:12,127 INFO L93 Difference]: Finished difference Result 851 states and 1128 transitions. [2025-03-17 05:33:12,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:33:12,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-03-17 05:33:12,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:12,132 INFO L225 Difference]: With dead ends: 851 [2025-03-17 05:33:12,132 INFO L226 Difference]: Without dead ends: 452 [2025-03-17 05:33:12,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:33:12,133 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 43 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:12,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 449 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:33:12,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-17 05:33:12,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 412. [2025-03-17 05:33:12,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 373 states have (on average 1.2815013404825737) internal successors, (478), 373 states have internal predecessors, (478), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:33:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 546 transitions. [2025-03-17 05:33:12,170 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 546 transitions. Word has length 135 [2025-03-17 05:33:12,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:12,171 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 546 transitions. [2025-03-17 05:33:12,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:12,171 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 546 transitions. [2025-03-17 05:33:12,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:33:12,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:12,173 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:12,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:33:12,173 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:12,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:12,173 INFO L85 PathProgramCache]: Analyzing trace with hash 547572526, now seen corresponding path program 1 times [2025-03-17 05:33:12,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:12,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879803899] [2025-03-17 05:33:12,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:12,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:12,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:33:12,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:33:12,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:12,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:12,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:12,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879803899] [2025-03-17 05:33:12,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879803899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:12,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:12,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:33:12,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629908615] [2025-03-17 05:33:12,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:12,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:33:12,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:12,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:33:12,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:33:12,944 INFO L87 Difference]: Start difference. First operand 412 states and 546 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:33:13,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:13,552 INFO L93 Difference]: Finished difference Result 793 states and 1046 transitions. [2025-03-17 05:33:13,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:33:13,553 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-03-17 05:33:13,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:13,556 INFO L225 Difference]: With dead ends: 793 [2025-03-17 05:33:13,556 INFO L226 Difference]: Without dead ends: 560 [2025-03-17 05:33:13,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:33:13,558 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 201 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:13,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 845 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:33:13,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-17 05:33:13,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 522. [2025-03-17 05:33:13,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 483 states have (on average 1.2857142857142858) internal successors, (621), 483 states have internal predecessors, (621), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:33:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 689 transitions. [2025-03-17 05:33:13,613 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 689 transitions. Word has length 135 [2025-03-17 05:33:13,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:13,613 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 689 transitions. [2025-03-17 05:33:13,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:33:13,614 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 689 transitions. [2025-03-17 05:33:13,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:33:13,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:13,615 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:13,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:33:13,616 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:13,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:13,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1259881937, now seen corresponding path program 1 times [2025-03-17 05:33:13,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:13,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035088923] [2025-03-17 05:33:13,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:13,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:13,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:33:13,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:33:13,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:13,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:13,938 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:13,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:13,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035088923] [2025-03-17 05:33:13,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035088923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:13,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:13,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:33:13,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520574935] [2025-03-17 05:33:13,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:13,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:33:13,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:13,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:33:13,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:33:13,940 INFO L87 Difference]: Start difference. First operand 522 states and 689 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:33:14,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:14,275 INFO L93 Difference]: Finished difference Result 899 states and 1184 transitions. [2025-03-17 05:33:14,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:33:14,276 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-03-17 05:33:14,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:14,279 INFO L225 Difference]: With dead ends: 899 [2025-03-17 05:33:14,279 INFO L226 Difference]: Without dead ends: 556 [2025-03-17 05:33:14,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:33:14,281 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 233 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:14,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 388 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:33:14,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-17 05:33:14,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 522. [2025-03-17 05:33:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 483 states have (on average 1.2836438923395446) internal successors, (620), 483 states have internal predecessors, (620), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:33:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 688 transitions. [2025-03-17 05:33:14,324 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 688 transitions. Word has length 135 [2025-03-17 05:33:14,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:14,324 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 688 transitions. [2025-03-17 05:33:14,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:33:14,325 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 688 transitions. [2025-03-17 05:33:14,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:33:14,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:14,342 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:14,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 05:33:14,343 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:14,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:14,343 INFO L85 PathProgramCache]: Analyzing trace with hash -747724464, now seen corresponding path program 1 times [2025-03-17 05:33:14,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:14,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152926429] [2025-03-17 05:33:14,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:14,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:14,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:33:14,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:33:14,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:14,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:14,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:14,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152926429] [2025-03-17 05:33:14,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152926429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:14,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:14,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:33:14,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313758875] [2025-03-17 05:33:14,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:14,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:33:14,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:14,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:33:14,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:33:14,805 INFO L87 Difference]: Start difference. First operand 522 states and 688 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:15,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:15,152 INFO L93 Difference]: Finished difference Result 1038 states and 1365 transitions. [2025-03-17 05:33:15,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:33:15,153 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-03-17 05:33:15,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:15,156 INFO L225 Difference]: With dead ends: 1038 [2025-03-17 05:33:15,156 INFO L226 Difference]: Without dead ends: 695 [2025-03-17 05:33:15,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:33:15,158 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 207 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:15,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 507 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:33:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-03-17 05:33:15,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 647. [2025-03-17 05:33:15,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 608 states have (on average 1.2911184210526316) internal successors, (785), 608 states have internal predecessors, (785), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:33:15,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 853 transitions. [2025-03-17 05:33:15,191 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 853 transitions. Word has length 135 [2025-03-17 05:33:15,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:15,192 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 853 transitions. [2025-03-17 05:33:15,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:15,192 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 853 transitions. [2025-03-17 05:33:15,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:33:15,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:15,194 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:15,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:33:15,194 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:15,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:15,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1739788369, now seen corresponding path program 1 times [2025-03-17 05:33:15,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:15,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374975559] [2025-03-17 05:33:15,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:15,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:15,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:33:15,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:33:15,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:15,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:16,101 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:16,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:16,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374975559] [2025-03-17 05:33:16,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374975559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:16,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:16,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 05:33:16,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356715804] [2025-03-17 05:33:16,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:16,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:33:16,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:16,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:33:16,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:33:16,103 INFO L87 Difference]: Start difference. First operand 647 states and 853 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:33:17,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:17,164 INFO L93 Difference]: Finished difference Result 1153 states and 1517 transitions. [2025-03-17 05:33:17,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:33:17,169 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-03-17 05:33:17,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:17,172 INFO L225 Difference]: With dead ends: 1153 [2025-03-17 05:33:17,173 INFO L226 Difference]: Without dead ends: 685 [2025-03-17 05:33:17,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:33:17,177 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 213 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:17,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1090 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:33:17,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-17 05:33:17,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 647. [2025-03-17 05:33:17,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 608 states have (on average 1.2911184210526316) internal successors, (785), 608 states have internal predecessors, (785), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:33:17,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 853 transitions. [2025-03-17 05:33:17,221 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 853 transitions. Word has length 135 [2025-03-17 05:33:17,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:17,222 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 853 transitions. [2025-03-17 05:33:17,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:33:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 853 transitions. [2025-03-17 05:33:17,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:33:17,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:17,224 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:17,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 05:33:17,225 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:17,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:17,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1843982479, now seen corresponding path program 1 times [2025-03-17 05:33:17,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:17,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127841158] [2025-03-17 05:33:17,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:17,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:17,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:33:17,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:33:17,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:17,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:17,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:17,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127841158] [2025-03-17 05:33:17,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127841158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:17,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:17,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:33:17,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726000080] [2025-03-17 05:33:17,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:17,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:33:17,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:17,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:33:17,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:33:17,863 INFO L87 Difference]: Start difference. First operand 647 states and 853 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:33:18,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:18,294 INFO L93 Difference]: Finished difference Result 1193 states and 1569 transitions. [2025-03-17 05:33:18,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:33:18,295 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-03-17 05:33:18,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:18,298 INFO L225 Difference]: With dead ends: 1193 [2025-03-17 05:33:18,298 INFO L226 Difference]: Without dead ends: 725 [2025-03-17 05:33:18,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:33:18,300 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 251 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:18,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 689 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:33:18,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2025-03-17 05:33:18,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 685. [2025-03-17 05:33:18,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 646 states have (on average 1.2925696594427245) internal successors, (835), 646 states have internal predecessors, (835), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:33:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 903 transitions. [2025-03-17 05:33:18,344 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 903 transitions. Word has length 135 [2025-03-17 05:33:18,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:18,345 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 903 transitions. [2025-03-17 05:33:18,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:33:18,345 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 903 transitions. [2025-03-17 05:33:18,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:33:18,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:18,348 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:18,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 05:33:18,348 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:18,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:18,349 INFO L85 PathProgramCache]: Analyzing trace with hash -799351947, now seen corresponding path program 1 times [2025-03-17 05:33:18,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:18,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297773940] [2025-03-17 05:33:18,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:18,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:18,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:33:18,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:33:18,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:18,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:18,546 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:18,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:18,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297773940] [2025-03-17 05:33:18,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297773940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:18,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:18,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:33:18,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355901136] [2025-03-17 05:33:18,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:18,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:33:18,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:18,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:33:18,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:33:18,549 INFO L87 Difference]: Start difference. First operand 685 states and 903 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:18,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:18,663 INFO L93 Difference]: Finished difference Result 1469 states and 1927 transitions. [2025-03-17 05:33:18,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:33:18,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-03-17 05:33:18,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:18,667 INFO L225 Difference]: With dead ends: 1469 [2025-03-17 05:33:18,668 INFO L226 Difference]: Without dead ends: 655 [2025-03-17 05:33:18,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:33:18,670 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 49 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:18,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 517 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:33:18,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-03-17 05:33:18,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 612. [2025-03-17 05:33:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 573 states have (on average 1.2739965095986039) internal successors, (730), 573 states have internal predecessors, (730), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:33:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 798 transitions. [2025-03-17 05:33:18,733 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 798 transitions. Word has length 135 [2025-03-17 05:33:18,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:18,734 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 798 transitions. [2025-03-17 05:33:18,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:18,734 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 798 transitions. [2025-03-17 05:33:18,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:33:18,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:18,736 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:18,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 05:33:18,737 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:18,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:18,737 INFO L85 PathProgramCache]: Analyzing trace with hash 708199862, now seen corresponding path program 1 times [2025-03-17 05:33:18,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:18,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544069150] [2025-03-17 05:33:18,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:18,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:18,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:33:18,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:33:18,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:18,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:19,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:19,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544069150] [2025-03-17 05:33:19,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544069150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:19,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:19,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:33:19,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9570830] [2025-03-17 05:33:19,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:19,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:33:19,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:19,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:33:19,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:33:19,511 INFO L87 Difference]: Start difference. First operand 612 states and 798 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:33:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:19,988 INFO L93 Difference]: Finished difference Result 1253 states and 1631 transitions. [2025-03-17 05:33:19,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:33:19,989 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2025-03-17 05:33:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:19,991 INFO L225 Difference]: With dead ends: 1253 [2025-03-17 05:33:19,991 INFO L226 Difference]: Without dead ends: 642 [2025-03-17 05:33:19,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:33:19,992 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 404 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:19,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 338 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:33:19,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-03-17 05:33:20,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 608. [2025-03-17 05:33:20,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 569 states have (on average 1.2636203866432338) internal successors, (719), 569 states have internal predecessors, (719), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:33:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 787 transitions. [2025-03-17 05:33:20,033 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 787 transitions. Word has length 135 [2025-03-17 05:33:20,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:20,033 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 787 transitions. [2025-03-17 05:33:20,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:33:20,034 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 787 transitions. [2025-03-17 05:33:20,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:33:20,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:20,035 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:20,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 05:33:20,036 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:20,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:20,036 INFO L85 PathProgramCache]: Analyzing trace with hash 325479578, now seen corresponding path program 1 times [2025-03-17 05:33:20,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:20,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641379726] [2025-03-17 05:33:20,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:20,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:20,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:33:20,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:33:20,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:20,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:20,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:20,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641379726] [2025-03-17 05:33:20,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641379726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:20,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:20,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:33:20,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259367800] [2025-03-17 05:33:20,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:20,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:33:20,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:20,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:33:20,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:33:20,912 INFO L87 Difference]: Start difference. First operand 608 states and 787 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:33:21,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:21,422 INFO L93 Difference]: Finished difference Result 1082 states and 1399 transitions. [2025-03-17 05:33:21,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:33:21,423 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 136 [2025-03-17 05:33:21,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:21,425 INFO L225 Difference]: With dead ends: 1082 [2025-03-17 05:33:21,425 INFO L226 Difference]: Without dead ends: 635 [2025-03-17 05:33:21,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:33:21,427 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 268 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:21,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 283 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:33:21,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-03-17 05:33:21,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 600. [2025-03-17 05:33:21,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 561 states have (on average 1.2602495543672014) internal successors, (707), 561 states have internal predecessors, (707), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:33:21,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 775 transitions. [2025-03-17 05:33:21,471 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 775 transitions. Word has length 136 [2025-03-17 05:33:21,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:21,472 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 775 transitions. [2025-03-17 05:33:21,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:33:21,472 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 775 transitions. [2025-03-17 05:33:21,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 05:33:21,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:21,474 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:21,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 05:33:21,475 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:21,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:21,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1576563078, now seen corresponding path program 1 times [2025-03-17 05:33:21,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:21,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565234853] [2025-03-17 05:33:21,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:21,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:21,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 05:33:21,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 05:33:21,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:21,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:21,930 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:21,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:21,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565234853] [2025-03-17 05:33:21,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565234853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:21,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:21,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:33:21,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119843924] [2025-03-17 05:33:21,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:21,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:33:21,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:21,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:33:21,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:33:21,932 INFO L87 Difference]: Start difference. First operand 600 states and 775 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:22,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:22,113 INFO L93 Difference]: Finished difference Result 825 states and 1032 transitions. [2025-03-17 05:33:22,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:33:22,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2025-03-17 05:33:22,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:22,118 INFO L225 Difference]: With dead ends: 825 [2025-03-17 05:33:22,118 INFO L226 Difference]: Without dead ends: 823 [2025-03-17 05:33:22,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:33:22,119 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 66 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:22,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 880 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:33:22,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2025-03-17 05:33:22,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 819. [2025-03-17 05:33:22,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 752 states have (on average 1.2101063829787233) internal successors, (910), 754 states have internal predecessors, (910), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:33:22,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1026 transitions. [2025-03-17 05:33:22,195 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1026 transitions. Word has length 137 [2025-03-17 05:33:22,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:22,195 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1026 transitions. [2025-03-17 05:33:22,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1026 transitions. [2025-03-17 05:33:22,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 05:33:22,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:22,197 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:22,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 05:33:22,197 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:22,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:22,198 INFO L85 PathProgramCache]: Analyzing trace with hash 656064971, now seen corresponding path program 1 times [2025-03-17 05:33:22,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:22,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006918820] [2025-03-17 05:33:22,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:22,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 05:33:22,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 05:33:22,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:22,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:22,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:22,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006918820] [2025-03-17 05:33:22,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006918820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:22,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:22,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:33:22,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026623622] [2025-03-17 05:33:22,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:22,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:33:22,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:22,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:33:22,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:33:22,363 INFO L87 Difference]: Start difference. First operand 819 states and 1026 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:22,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:22,500 INFO L93 Difference]: Finished difference Result 1674 states and 2095 transitions. [2025-03-17 05:33:22,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:33:22,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2025-03-17 05:33:22,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:22,505 INFO L225 Difference]: With dead ends: 1674 [2025-03-17 05:33:22,505 INFO L226 Difference]: Without dead ends: 856 [2025-03-17 05:33:22,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:33:22,507 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 40 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:22,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 518 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:33:22,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2025-03-17 05:33:22,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 819. [2025-03-17 05:33:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 752 states have (on average 1.2061170212765957) internal successors, (907), 754 states have internal predecessors, (907), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:33:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1023 transitions. [2025-03-17 05:33:22,580 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1023 transitions. Word has length 137 [2025-03-17 05:33:22,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:22,581 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1023 transitions. [2025-03-17 05:33:22,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1023 transitions. [2025-03-17 05:33:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 05:33:22,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:22,582 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:22,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 05:33:22,583 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:22,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:22,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1841950966, now seen corresponding path program 1 times [2025-03-17 05:33:22,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:22,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914882133] [2025-03-17 05:33:22,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:22,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:22,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 05:33:22,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 05:33:22,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:22,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:22,749 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:22,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:22,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914882133] [2025-03-17 05:33:22,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914882133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:22,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:22,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:33:22,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521202090] [2025-03-17 05:33:22,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:22,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:33:22,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:22,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:33:22,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:33:22,751 INFO L87 Difference]: Start difference. First operand 819 states and 1023 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:22,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:22,873 INFO L93 Difference]: Finished difference Result 1674 states and 2089 transitions. [2025-03-17 05:33:22,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:33:22,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2025-03-17 05:33:22,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:22,877 INFO L225 Difference]: With dead ends: 1674 [2025-03-17 05:33:22,877 INFO L226 Difference]: Without dead ends: 856 [2025-03-17 05:33:22,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:33:22,879 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 68 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:22,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 413 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:33:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2025-03-17 05:33:22,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 836. [2025-03-17 05:33:22,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 769 states have (on average 1.2015604681404422) internal successors, (924), 771 states have internal predecessors, (924), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:33:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1040 transitions. [2025-03-17 05:33:22,955 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1040 transitions. Word has length 137 [2025-03-17 05:33:22,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:22,955 INFO L471 AbstractCegarLoop]: Abstraction has 836 states and 1040 transitions. [2025-03-17 05:33:22,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:22,955 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1040 transitions. [2025-03-17 05:33:22,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 05:33:22,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:22,957 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:22,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 05:33:22,957 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:22,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:22,958 INFO L85 PathProgramCache]: Analyzing trace with hash -617602858, now seen corresponding path program 1 times [2025-03-17 05:33:22,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:22,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793411817] [2025-03-17 05:33:22,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:22,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:22,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:33:22,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:33:22,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:22,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:23,112 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:23,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:23,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793411817] [2025-03-17 05:33:23,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793411817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:23,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:23,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:33:23,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312785925] [2025-03-17 05:33:23,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:23,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:33:23,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:23,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:33:23,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:33:23,114 INFO L87 Difference]: Start difference. First operand 836 states and 1040 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:23,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:23,226 INFO L93 Difference]: Finished difference Result 1521 states and 1900 transitions. [2025-03-17 05:33:23,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:33:23,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2025-03-17 05:33:23,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:23,230 INFO L225 Difference]: With dead ends: 1521 [2025-03-17 05:33:23,230 INFO L226 Difference]: Without dead ends: 686 [2025-03-17 05:33:23,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:33:23,232 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 99 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:23,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 342 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:33:23,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-03-17 05:33:23,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 683. [2025-03-17 05:33:23,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 616 states have (on average 1.1704545454545454) internal successors, (721), 618 states have internal predecessors, (721), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:33:23,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 837 transitions. [2025-03-17 05:33:23,325 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 837 transitions. Word has length 138 [2025-03-17 05:33:23,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:23,325 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 837 transitions. [2025-03-17 05:33:23,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:23,325 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 837 transitions. [2025-03-17 05:33:23,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:33:23,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:23,328 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:23,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 05:33:23,328 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:23,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:23,329 INFO L85 PathProgramCache]: Analyzing trace with hash 210244979, now seen corresponding path program 1 times [2025-03-17 05:33:23,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:23,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539776959] [2025-03-17 05:33:23,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:23,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:23,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:33:23,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:33:23,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:23,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:23,494 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:23,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:23,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539776959] [2025-03-17 05:33:23,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539776959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:23,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:23,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:33:23,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749088350] [2025-03-17 05:33:23,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:23,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:33:23,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:23,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:33:23,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:33:23,495 INFO L87 Difference]: Start difference. First operand 683 states and 837 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:23,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:23,615 INFO L93 Difference]: Finished difference Result 1281 states and 1570 transitions. [2025-03-17 05:33:23,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:33:23,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-17 05:33:23,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:23,619 INFO L225 Difference]: With dead ends: 1281 [2025-03-17 05:33:23,619 INFO L226 Difference]: Without dead ends: 599 [2025-03-17 05:33:23,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:33:23,621 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 110 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:23,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 410 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:33:23,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-17 05:33:23,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 593. [2025-03-17 05:33:23,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 526 states have (on average 1.1596958174904943) internal successors, (610), 528 states have internal predecessors, (610), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:33:23,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 726 transitions. [2025-03-17 05:33:23,699 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 726 transitions. Word has length 139 [2025-03-17 05:33:23,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:23,699 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 726 transitions. [2025-03-17 05:33:23,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:23,699 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 726 transitions. [2025-03-17 05:33:23,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:33:23,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:23,700 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:23,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 05:33:23,701 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:23,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:23,701 INFO L85 PathProgramCache]: Analyzing trace with hash 628455388, now seen corresponding path program 1 times [2025-03-17 05:33:23,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:23,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980738589] [2025-03-17 05:33:23,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:23,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:23,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:33:23,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:33:23,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:23,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:23,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:23,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980738589] [2025-03-17 05:33:23,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980738589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:23,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:23,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:33:23,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688432565] [2025-03-17 05:33:23,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:23,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:33:23,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:23,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:33:23,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:33:23,897 INFO L87 Difference]: Start difference. First operand 593 states and 726 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:24,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:24,126 INFO L93 Difference]: Finished difference Result 1479 states and 1765 transitions. [2025-03-17 05:33:24,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:33:24,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2025-03-17 05:33:24,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:24,129 INFO L225 Difference]: With dead ends: 1479 [2025-03-17 05:33:24,129 INFO L226 Difference]: Without dead ends: 915 [2025-03-17 05:33:24,131 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-17 05:33:24,134 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 42 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:24,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 454 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:33:24,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-03-17 05:33:24,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 845. [2025-03-17 05:33:24,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 778 states have (on average 1.1259640102827764) internal successors, (876), 780 states have internal predecessors, (876), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:33:24,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 992 transitions. [2025-03-17 05:33:24,230 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 992 transitions. Word has length 140 [2025-03-17 05:33:24,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:24,231 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 992 transitions. [2025-03-17 05:33:24,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 992 transitions. [2025-03-17 05:33:24,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:33:24,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:24,233 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:24,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 05:33:24,233 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:24,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:24,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1923701573, now seen corresponding path program 1 times [2025-03-17 05:33:24,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:24,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466758802] [2025-03-17 05:33:24,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:24,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:24,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:33:24,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:33:24,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:24,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:24,439 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:24,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:24,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466758802] [2025-03-17 05:33:24,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466758802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:24,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:24,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:33:24,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588908984] [2025-03-17 05:33:24,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:24,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:33:24,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:24,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:33:24,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:33:24,441 INFO L87 Difference]: Start difference. First operand 845 states and 992 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:24,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:24,569 INFO L93 Difference]: Finished difference Result 1645 states and 1922 transitions. [2025-03-17 05:33:24,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:33:24,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2025-03-17 05:33:24,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:24,573 INFO L225 Difference]: With dead ends: 1645 [2025-03-17 05:33:24,574 INFO L226 Difference]: Without dead ends: 829 [2025-03-17 05:33:24,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:33:24,575 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 51 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:24,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 334 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:33:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-03-17 05:33:24,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 662. [2025-03-17 05:33:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 595 states have (on average 1.1411764705882352) internal successors, (679), 597 states have internal predecessors, (679), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:33:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 795 transitions. [2025-03-17 05:33:24,680 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 795 transitions. Word has length 140 [2025-03-17 05:33:24,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:24,684 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 795 transitions. [2025-03-17 05:33:24,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:24,713 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 795 transitions. [2025-03-17 05:33:24,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:33:24,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:24,714 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:24,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 05:33:24,714 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:24,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:24,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1941093336, now seen corresponding path program 1 times [2025-03-17 05:33:24,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:24,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734034075] [2025-03-17 05:33:24,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:24,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:24,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:33:24,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:33:24,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:24,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:33:25,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:33:25,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734034075] [2025-03-17 05:33:25,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734034075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:25,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:25,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:33:25,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851009360] [2025-03-17 05:33:25,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:25,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:33:25,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:33:25,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:33:25,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:33:25,729 INFO L87 Difference]: Start difference. First operand 662 states and 795 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:26,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:26,190 INFO L93 Difference]: Finished difference Result 831 states and 976 transitions. [2025-03-17 05:33:26,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:33:26,195 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2025-03-17 05:33:26,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:26,197 INFO L225 Difference]: With dead ends: 831 [2025-03-17 05:33:26,197 INFO L226 Difference]: Without dead ends: 829 [2025-03-17 05:33:26,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:33:26,198 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 137 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:26,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1140 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:33:26,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-03-17 05:33:26,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 789. [2025-03-17 05:33:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 722 states have (on average 1.1204986149584488) internal successors, (809), 724 states have internal predecessors, (809), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:33:26,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 925 transitions. [2025-03-17 05:33:26,278 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 925 transitions. Word has length 140 [2025-03-17 05:33:26,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:26,279 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 925 transitions. [2025-03-17 05:33:26,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:33:26,279 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 925 transitions. [2025-03-17 05:33:26,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:33:26,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:26,280 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:33:26,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 05:33:26,281 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:26,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:26,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1466370279, now seen corresponding path program 1 times [2025-03-17 05:33:26,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:33:26,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081357726] [2025-03-17 05:33:26,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:26,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:33:26,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:33:26,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:33:26,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:26,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat