./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.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-a_file-66.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 d3f6bd0cc41c3fb11f5cfcc3010a6654288179c0475495df5b9f3093567937e2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:26:27,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:26:27,704 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:26:27,711 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:26:27,711 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:26:27,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:26:27,733 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:26:27,733 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:26:27,733 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:26:27,733 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:26:27,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:26:27,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:26:27,734 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:26:27,734 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:26:27,734 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:26:27,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:26:27,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:26:27,734 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:26:27,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:26:27,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:26:27,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:26:27,735 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:26:27,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:26:27,735 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:26:27,735 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:26:27,735 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:26:27,735 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:26:27,735 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:26:27,735 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:26:27,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:26:27,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:26:27,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:26:27,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:26:27,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:26:27,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:26:27,736 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:26:27,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:26:27,736 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:26:27,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:26:27,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:26:27,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:26:27,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:26:27,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:26:27,736 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 -> d3f6bd0cc41c3fb11f5cfcc3010a6654288179c0475495df5b9f3093567937e2 [2025-03-17 05:26:28,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:26:28,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:26:28,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:26:28,020 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:26:28,020 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:26:28,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.i [2025-03-17 05:26:29,242 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2fbbb2f9/b81436a41c414b358a863b686ef58276/FLAG28f3af26c [2025-03-17 05:26:29,539 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:26:29,540 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.i [2025-03-17 05:26:29,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2fbbb2f9/b81436a41c414b358a863b686ef58276/FLAG28f3af26c [2025-03-17 05:26:29,821 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2fbbb2f9/b81436a41c414b358a863b686ef58276 [2025-03-17 05:26:29,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:26:29,824 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:26:29,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:26:29,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:26:29,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:26:29,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:26:29" (1/1) ... [2025-03-17 05:26:29,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7954eaf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:29, skipping insertion in model container [2025-03-17 05:26:29,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:26:29" (1/1) ... [2025-03-17 05:26:29,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:26:29,970 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-a_file-66.i[916,929] [2025-03-17 05:26:30,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:26:30,060 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:26:30,067 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-a_file-66.i[916,929] [2025-03-17 05:26:30,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:26:30,132 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:26:30,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:30 WrapperNode [2025-03-17 05:26:30,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:26:30,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:26:30,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:26:30,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:26:30,140 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:26:30" (1/1) ... [2025-03-17 05:26:30,155 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:26:30" (1/1) ... [2025-03-17 05:26:30,199 INFO L138 Inliner]: procedures = 26, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 431 [2025-03-17 05:26:30,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:26:30,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:26:30,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:26:30,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:26:30,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:30" (1/1) ... [2025-03-17 05:26:30,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:30" (1/1) ... [2025-03-17 05:26:30,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:30" (1/1) ... [2025-03-17 05:26:30,250 INFO L175 MemorySlicer]: Split 123 memory accesses to 6 slices as follows [2, 8, 8, 73, 7, 25]. 59 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 6, 1, 3]. The 16 writes are split as follows [0, 1, 3, 7, 1, 4]. [2025-03-17 05:26:30,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:30" (1/1) ... [2025-03-17 05:26:30,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:30" (1/1) ... [2025-03-17 05:26:30,267 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:30" (1/1) ... [2025-03-17 05:26:30,268 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:30" (1/1) ... [2025-03-17 05:26:30,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:30" (1/1) ... [2025-03-17 05:26:30,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:30" (1/1) ... [2025-03-17 05:26:30,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:26:30,283 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:26:30,283 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:26:30,283 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:26:30,286 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:30" (1/1) ... [2025-03-17 05:26:30,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:26:30,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:26:30,315 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:26:30,322 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:26:30,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:26:30,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:26:30,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:26:30,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:26:30,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:26:30,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:26:30,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:26:30,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:26:30,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:26:30,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:26:30,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:26:30,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:26:30,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:26:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:26:30,339 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:26:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:26:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:26:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:26:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:26:30,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:26:30,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:26:30,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:26:30,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:26:30,442 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:26:30,443 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:26:30,779 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~ite76#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem70#1;havoc property_#t~mem75#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~short79#1;havoc property_#t~ite100#1;havoc property_#t~mem80#1;havoc property_#t~ite99#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~mem98#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite114#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short108#1;havoc property_#t~ite113#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short115#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short121#1; [2025-03-17 05:26:30,807 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-03-17 05:26:30,807 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:26:30,817 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:26:30,818 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:26:30,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:26:30 BoogieIcfgContainer [2025-03-17 05:26:30,818 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:26:30,820 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:26:30,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:26:30,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:26:30,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:26:29" (1/3) ... [2025-03-17 05:26:30,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2476aa82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:26:30, skipping insertion in model container [2025-03-17 05:26:30,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:30" (2/3) ... [2025-03-17 05:26:30,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2476aa82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:26:30, skipping insertion in model container [2025-03-17 05:26:30,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:26:30" (3/3) ... [2025-03-17 05:26:30,826 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-66.i [2025-03-17 05:26:30,839 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:26:30,841 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-66.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:26:30,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:26:30,898 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;@53cede9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:26:30,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:26:30,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 64 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:26:30,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:26:30,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:30,910 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:30,911 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:30,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:30,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1956825230, now seen corresponding path program 1 times [2025-03-17 05:26:30,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:30,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582888776] [2025-03-17 05:26:30,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:30,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:31,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:26:31,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:26:31,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:31,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:31,153 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 05:26:31,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:31,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582888776] [2025-03-17 05:26:31,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582888776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:26:31,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365967676] [2025-03-17 05:26:31,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:31,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:26:31,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:26:31,161 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:26:31,170 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:26:31,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:26:31,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:26:31,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:31,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:31,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:26:31,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 05:26:31,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:26:31,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365967676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:31,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:26:31,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:26:31,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859558566] [2025-03-17 05:26:31,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:31,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:26:31,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:31,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:26:31,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:26:31,434 INFO L87 Difference]: Start difference. First operand has 80 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 64 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:26:31,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:31,453 INFO L93 Difference]: Finished difference Result 157 states and 248 transitions. [2025-03-17 05:26:31,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:26:31,455 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2025-03-17 05:26:31,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:31,462 INFO L225 Difference]: With dead ends: 157 [2025-03-17 05:26:31,463 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 05:26:31,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 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:26:31,470 INFO L435 NwaCegarLoop]: 114 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, 114 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:26:31,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:26:31,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 05:26:31,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-17 05:26:31,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 62 states have internal predecessors, (86), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:26:31,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 114 transitions. [2025-03-17 05:26:31,525 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 114 transitions. Word has length 105 [2025-03-17 05:26:31,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:31,525 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 114 transitions. [2025-03-17 05:26:31,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:26:31,525 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 114 transitions. [2025-03-17 05:26:31,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:26:31,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:31,528 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:31,536 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:26:31,729 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:26:31,729 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:31,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:31,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1230051520, now seen corresponding path program 1 times [2025-03-17 05:26:31,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:31,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794900539] [2025-03-17 05:26:31,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:31,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:31,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:26:31,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:26:31,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:31,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:26:32,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:32,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794900539] [2025-03-17 05:26:32,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794900539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:32,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:32,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:26:32,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523117035] [2025-03-17 05:26:32,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:32,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:26:32,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:32,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:26:32,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:26:32,003 INFO L87 Difference]: Start difference. First operand 78 states and 114 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:26:32,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:32,050 INFO L93 Difference]: Finished difference Result 158 states and 231 transitions. [2025-03-17 05:26:32,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:26:32,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 105 [2025-03-17 05:26:32,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:32,053 INFO L225 Difference]: With dead ends: 158 [2025-03-17 05:26:32,053 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 05:26:32,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:26:32,054 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:32,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 322 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:26:32,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 05:26:32,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2025-03-17 05:26:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:26:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 116 transitions. [2025-03-17 05:26:32,067 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 116 transitions. Word has length 105 [2025-03-17 05:26:32,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:32,069 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 116 transitions. [2025-03-17 05:26:32,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:26:32,069 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 116 transitions. [2025-03-17 05:26:32,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:26:32,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:32,071 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:32,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:26:32,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:32,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:32,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2117555201, now seen corresponding path program 1 times [2025-03-17 05:26:32,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:32,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26329299] [2025-03-17 05:26:32,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:32,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:32,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:26:32,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:26:32,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:32,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:32,331 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:26:32,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:32,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26329299] [2025-03-17 05:26:32,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26329299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:32,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:32,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:26:32,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165896063] [2025-03-17 05:26:32,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:32,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:26:32,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:32,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:26:32,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:26:32,334 INFO L87 Difference]: Start difference. First operand 80 states and 116 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:26:32,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:32,365 INFO L93 Difference]: Finished difference Result 162 states and 235 transitions. [2025-03-17 05:26:32,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:26:32,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 105 [2025-03-17 05:26:32,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:32,367 INFO L225 Difference]: With dead ends: 162 [2025-03-17 05:26:32,368 INFO L226 Difference]: Without dead ends: 83 [2025-03-17 05:26:32,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:26:32,370 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:32,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:26:32,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-17 05:26:32,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2025-03-17 05:26:32,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:26:32,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2025-03-17 05:26:32,384 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 105 [2025-03-17 05:26:32,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:32,384 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2025-03-17 05:26:32,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:26:32,384 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2025-03-17 05:26:32,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:26:32,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:32,385 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:32,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:26:32,386 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:32,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:32,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2118478722, now seen corresponding path program 1 times [2025-03-17 05:26:32,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:32,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494402535] [2025-03-17 05:26:32,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:32,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:32,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:26:32,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:26:32,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:32,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:33,038 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:26:33,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:33,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494402535] [2025-03-17 05:26:33,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494402535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:33,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:33,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:26:33,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561420425] [2025-03-17 05:26:33,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:33,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:26:33,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:33,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:26:33,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:26:33,043 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:26:33,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:33,248 INFO L93 Difference]: Finished difference Result 244 states and 352 transitions. [2025-03-17 05:26:33,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:26:33,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 105 [2025-03-17 05:26:33,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:33,250 INFO L225 Difference]: With dead ends: 244 [2025-03-17 05:26:33,250 INFO L226 Difference]: Without dead ends: 163 [2025-03-17 05:26:33,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:26:33,251 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 77 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:33,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 237 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:26:33,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-17 05:26:33,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 155. [2025-03-17 05:26:33,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 124 states have (on average 1.346774193548387) internal successors, (167), 124 states have internal predecessors, (167), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:26:33,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 223 transitions. [2025-03-17 05:26:33,281 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 223 transitions. Word has length 105 [2025-03-17 05:26:33,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:33,284 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 223 transitions. [2025-03-17 05:26:33,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:26:33,284 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 223 transitions. [2025-03-17 05:26:33,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 05:26:33,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:33,285 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:33,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:26:33,285 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:33,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:33,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1912567674, now seen corresponding path program 1 times [2025-03-17 05:26:33,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:33,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097912322] [2025-03-17 05:26:33,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:33,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:33,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 05:26:33,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 05:26:33,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:33,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:36,093 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:26:36,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:36,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097912322] [2025-03-17 05:26:36,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097912322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:36,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:36,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:26:36,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500697804] [2025-03-17 05:26:36,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:36,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:26:36,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:36,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:26:36,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:26:36,097 INFO L87 Difference]: Start difference. First operand 155 states and 223 transitions. Second operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:26:38,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:38,741 INFO L93 Difference]: Finished difference Result 463 states and 661 transitions. [2025-03-17 05:26:38,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 05:26:38,745 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.25) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 106 [2025-03-17 05:26:38,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:38,748 INFO L225 Difference]: With dead ends: 463 [2025-03-17 05:26:38,748 INFO L226 Difference]: Without dead ends: 382 [2025-03-17 05:26:38,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=718, Unknown=0, NotChecked=0, Total=870 [2025-03-17 05:26:38,752 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 635 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:38,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 985 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 05:26:38,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-17 05:26:38,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 225. [2025-03-17 05:26:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 181 states have (on average 1.3480662983425415) internal successors, (244), 182 states have internal predecessors, (244), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:26:38,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 324 transitions. [2025-03-17 05:26:38,796 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 324 transitions. Word has length 106 [2025-03-17 05:26:38,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:38,796 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 324 transitions. [2025-03-17 05:26:38,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.25) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:26:38,796 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 324 transitions. [2025-03-17 05:26:38,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 05:26:38,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:38,798 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:38,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:26:38,798 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:38,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:38,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1619164667, now seen corresponding path program 1 times [2025-03-17 05:26:38,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:38,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946142559] [2025-03-17 05:26:38,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:38,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:38,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 05:26:38,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 05:26:38,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:38,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:26:39,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:39,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946142559] [2025-03-17 05:26:39,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946142559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:39,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:39,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:26:39,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636880664] [2025-03-17 05:26:39,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:39,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:26:39,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:39,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:26:39,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:26:39,773 INFO L87 Difference]: Start difference. First operand 225 states and 324 transitions. Second operand has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:26:40,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:40,683 INFO L93 Difference]: Finished difference Result 616 states and 871 transitions. [2025-03-17 05:26:40,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:26:40,686 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 106 [2025-03-17 05:26:40,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:40,693 INFO L225 Difference]: With dead ends: 616 [2025-03-17 05:26:40,693 INFO L226 Difference]: Without dead ends: 392 [2025-03-17 05:26:40,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:26:40,696 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 392 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:40,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 428 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:26:40,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-17 05:26:40,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 320. [2025-03-17 05:26:40,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 255 states have (on average 1.3098039215686275) internal successors, (334), 258 states have internal predecessors, (334), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:26:40,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 446 transitions. [2025-03-17 05:26:40,741 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 446 transitions. Word has length 106 [2025-03-17 05:26:40,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:40,742 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 446 transitions. [2025-03-17 05:26:40,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:26:40,742 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 446 transitions. [2025-03-17 05:26:40,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:26:40,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:40,744 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:40,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:26:40,744 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:40,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:40,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1597843717, now seen corresponding path program 1 times [2025-03-17 05:26:40,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:40,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009931072] [2025-03-17 05:26:40,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:40,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:40,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:26:40,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:26:40,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:40,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:42,019 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:26:42,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:42,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009931072] [2025-03-17 05:26:42,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009931072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:42,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:42,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:26:42,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504715917] [2025-03-17 05:26:42,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:42,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:26:42,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:42,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:26:42,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:26:42,021 INFO L87 Difference]: Start difference. First operand 320 states and 446 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:26:42,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:42,931 INFO L93 Difference]: Finished difference Result 677 states and 938 transitions. [2025-03-17 05:26:42,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:26:42,932 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 107 [2025-03-17 05:26:42,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:42,934 INFO L225 Difference]: With dead ends: 677 [2025-03-17 05:26:42,934 INFO L226 Difference]: Without dead ends: 362 [2025-03-17 05:26:42,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:26:42,935 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 289 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:42,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 763 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:26:42,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-17 05:26:42,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 352. [2025-03-17 05:26:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 273 states have (on average 1.2857142857142858) internal successors, (351), 276 states have internal predecessors, (351), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 65 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 05:26:42,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 487 transitions. [2025-03-17 05:26:42,996 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 487 transitions. Word has length 107 [2025-03-17 05:26:42,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:42,997 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 487 transitions. [2025-03-17 05:26:42,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:26:42,998 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 487 transitions. [2025-03-17 05:26:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:26:42,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:42,999 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:42,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:26:43,000 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:43,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:43,001 INFO L85 PathProgramCache]: Analyzing trace with hash 753371846, now seen corresponding path program 1 times [2025-03-17 05:26:43,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:43,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071130288] [2025-03-17 05:26:43,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:43,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:43,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:26:43,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:26:43,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:43,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:26:43,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:43,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071130288] [2025-03-17 05:26:43,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071130288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:43,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:43,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:26:43,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636276642] [2025-03-17 05:26:43,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:43,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:26:43,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:43,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:26:43,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:26:43,306 INFO L87 Difference]: Start difference. First operand 352 states and 487 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:26:43,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:43,513 INFO L93 Difference]: Finished difference Result 605 states and 835 transitions. [2025-03-17 05:26:43,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:26:43,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 107 [2025-03-17 05:26:43,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:43,516 INFO L225 Difference]: With dead ends: 605 [2025-03-17 05:26:43,516 INFO L226 Difference]: Without dead ends: 286 [2025-03-17 05:26:43,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:26:43,517 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 76 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:43,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 234 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:26:43,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-17 05:26:43,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 279. [2025-03-17 05:26:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 216 states have (on average 1.2777777777777777) internal successors, (276), 218 states have internal predecessors, (276), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 05:26:43,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 384 transitions. [2025-03-17 05:26:43,575 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 384 transitions. Word has length 107 [2025-03-17 05:26:43,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:43,575 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 384 transitions. [2025-03-17 05:26:43,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:26:43,576 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 384 transitions. [2025-03-17 05:26:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:26:43,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:43,576 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:43,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:26:43,577 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:43,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:43,577 INFO L85 PathProgramCache]: Analyzing trace with hash -856324962, now seen corresponding path program 1 times [2025-03-17 05:26:43,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:43,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054091284] [2025-03-17 05:26:43,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:43,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:43,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:26:43,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:26:43,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:43,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:26:45,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:45,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054091284] [2025-03-17 05:26:45,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054091284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:45,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:45,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:26:45,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628093954] [2025-03-17 05:26:45,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:45,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:26:45,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:45,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:26:45,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:26:45,158 INFO L87 Difference]: Start difference. First operand 279 states and 384 transitions. Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:26:46,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:46,721 INFO L93 Difference]: Finished difference Result 592 states and 815 transitions. [2025-03-17 05:26:46,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 05:26:46,722 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2025-03-17 05:26:46,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:46,724 INFO L225 Difference]: With dead ends: 592 [2025-03-17 05:26:46,724 INFO L226 Difference]: Without dead ends: 499 [2025-03-17 05:26:46,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2025-03-17 05:26:46,725 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 355 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:46,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1248 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 05:26:46,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-03-17 05:26:46,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 283. [2025-03-17 05:26:46,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 220 states have (on average 1.2818181818181817) internal successors, (282), 222 states have internal predecessors, (282), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 05:26:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 390 transitions. [2025-03-17 05:26:46,780 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 390 transitions. Word has length 109 [2025-03-17 05:26:46,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:46,781 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 390 transitions. [2025-03-17 05:26:46,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:26:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 390 transitions. [2025-03-17 05:26:46,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:26:46,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:46,783 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:46,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:26:46,783 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:46,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:46,784 INFO L85 PathProgramCache]: Analyzing trace with hash 496984735, now seen corresponding path program 1 times [2025-03-17 05:26:46,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:46,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024586858] [2025-03-17 05:26:46,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:46,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:46,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:26:46,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:26:46,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:46,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:47,136 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:26:47,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:47,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024586858] [2025-03-17 05:26:47,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024586858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:47,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:47,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:26:47,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215261658] [2025-03-17 05:26:47,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:47,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:26:47,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:47,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:26:47,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:26:47,138 INFO L87 Difference]: Start difference. First operand 283 states and 390 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:26:47,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:47,726 INFO L93 Difference]: Finished difference Result 676 states and 934 transitions. [2025-03-17 05:26:47,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:26:47,726 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-03-17 05:26:47,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:47,731 INFO L225 Difference]: With dead ends: 676 [2025-03-17 05:26:47,731 INFO L226 Difference]: Without dead ends: 510 [2025-03-17 05:26:47,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:26:47,732 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 396 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:47,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 587 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:26:47,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-17 05:26:47,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 294. [2025-03-17 05:26:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 231 states have (on average 1.29004329004329) internal successors, (298), 233 states have internal predecessors, (298), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 05:26:47,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 406 transitions. [2025-03-17 05:26:47,802 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 406 transitions. Word has length 109 [2025-03-17 05:26:47,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:47,803 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 406 transitions. [2025-03-17 05:26:47,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:26:47,803 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 406 transitions. [2025-03-17 05:26:47,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:26:47,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:47,804 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:47,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:26:47,804 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:47,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:47,805 INFO L85 PathProgramCache]: Analyzing trace with hash 203581728, now seen corresponding path program 1 times [2025-03-17 05:26:47,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:47,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350003016] [2025-03-17 05:26:47,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:47,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:47,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:26:47,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:26:47,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:47,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:26:48,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:48,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350003016] [2025-03-17 05:26:48,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350003016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:48,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:48,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:26:48,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790439541] [2025-03-17 05:26:48,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:48,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:26:48,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:48,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:26:48,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:26:48,296 INFO L87 Difference]: Start difference. First operand 294 states and 406 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:26:48,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:48,510 INFO L93 Difference]: Finished difference Result 535 states and 740 transitions. [2025-03-17 05:26:48,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:26:48,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2025-03-17 05:26:48,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:48,515 INFO L225 Difference]: With dead ends: 535 [2025-03-17 05:26:48,515 INFO L226 Difference]: Without dead ends: 358 [2025-03-17 05:26:48,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:26:48,516 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 84 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:48,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 834 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:26:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-17 05:26:48,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 355. [2025-03-17 05:26:48,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 280 states have (on average 1.2892857142857144) internal successors, (361), 283 states have internal predecessors, (361), 64 states have call successors, (64), 10 states have call predecessors, (64), 10 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-17 05:26:48,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 489 transitions. [2025-03-17 05:26:48,589 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 489 transitions. Word has length 109 [2025-03-17 05:26:48,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:48,589 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 489 transitions. [2025-03-17 05:26:48,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:26:48,594 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 489 transitions. [2025-03-17 05:26:48,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:26:48,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:48,595 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:48,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:26:48,595 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:48,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:48,595 INFO L85 PathProgramCache]: Analyzing trace with hash -644974049, now seen corresponding path program 1 times [2025-03-17 05:26:48,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:48,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959302756] [2025-03-17 05:26:48,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:48,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:48,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:26:48,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:26:48,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:48,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:49,538 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:26:49,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:49,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959302756] [2025-03-17 05:26:49,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959302756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:49,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:49,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:26:49,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863245167] [2025-03-17 05:26:49,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:49,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:26:49,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:49,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:26:49,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:26:49,541 INFO L87 Difference]: Start difference. First operand 355 states and 489 transitions. Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:26:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:51,066 INFO L93 Difference]: Finished difference Result 874 states and 1207 transitions. [2025-03-17 05:26:51,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 05:26:51,067 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 109 [2025-03-17 05:26:51,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:51,071 INFO L225 Difference]: With dead ends: 874 [2025-03-17 05:26:51,073 INFO L226 Difference]: Without dead ends: 636 [2025-03-17 05:26:51,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=805, Unknown=0, NotChecked=0, Total=992 [2025-03-17 05:26:51,074 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 453 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:51,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1149 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 05:26:51,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-17 05:26:51,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 372. [2025-03-17 05:26:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 296 states have (on average 1.2939189189189189) internal successors, (383), 299 states have internal predecessors, (383), 64 states have call successors, (64), 11 states have call predecessors, (64), 11 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-17 05:26:51,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 511 transitions. [2025-03-17 05:26:51,144 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 511 transitions. Word has length 109 [2025-03-17 05:26:51,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:51,144 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 511 transitions. [2025-03-17 05:26:51,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:26:51,144 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 511 transitions. [2025-03-17 05:26:51,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:26:51,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:51,146 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:51,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:26:51,146 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:51,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:51,147 INFO L85 PathProgramCache]: Analyzing trace with hash 708335648, now seen corresponding path program 1 times [2025-03-17 05:26:51,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:51,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027868710] [2025-03-17 05:26:51,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:51,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:51,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:26:51,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:26:51,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:51,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:51,373 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:26:51,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:51,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027868710] [2025-03-17 05:26:51,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027868710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:51,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:51,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:26:51,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577739998] [2025-03-17 05:26:51,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:51,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:26:51,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:51,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:26:51,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:26:51,375 INFO L87 Difference]: Start difference. First operand 372 states and 511 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:26:51,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:51,733 INFO L93 Difference]: Finished difference Result 682 states and 937 transitions. [2025-03-17 05:26:51,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:26:51,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-03-17 05:26:51,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:51,736 INFO L225 Difference]: With dead ends: 682 [2025-03-17 05:26:51,736 INFO L226 Difference]: Without dead ends: 444 [2025-03-17 05:26:51,736 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:26:51,739 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 89 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:51,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 526 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:26:51,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-17 05:26:51,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 430. [2025-03-17 05:26:51,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 337 states have (on average 1.2789317507418398) internal successors, (431), 341 states have internal predecessors, (431), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-17 05:26:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 587 transitions. [2025-03-17 05:26:51,787 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 587 transitions. Word has length 109 [2025-03-17 05:26:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:51,787 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 587 transitions. [2025-03-17 05:26:51,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:26:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 587 transitions. [2025-03-17 05:26:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:26:51,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:51,788 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:51,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:26:51,789 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:51,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:51,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1131588889, now seen corresponding path program 1 times [2025-03-17 05:26:51,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:51,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769659982] [2025-03-17 05:26:51,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:51,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:51,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:26:51,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:26:51,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:51,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 05:26:51,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:51,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769659982] [2025-03-17 05:26:51,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769659982] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:26:51,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154656576] [2025-03-17 05:26:51,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:51,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:26:51,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:26:51,890 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:26:51,891 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:26:51,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:26:52,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:26:52,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:52,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:52,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:26:52,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:26:52,073 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:26:52,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154656576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:52,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:26:52,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:26:52,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465875785] [2025-03-17 05:26:52,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:52,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:26:52,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:52,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:26:52,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:26:52,074 INFO L87 Difference]: Start difference. First operand 430 states and 587 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:26:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:52,175 INFO L93 Difference]: Finished difference Result 838 states and 1145 transitions. [2025-03-17 05:26:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:26:52,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-03-17 05:26:52,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:52,179 INFO L225 Difference]: With dead ends: 838 [2025-03-17 05:26:52,180 INFO L226 Difference]: Without dead ends: 445 [2025-03-17 05:26:52,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:26:52,182 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:52,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 427 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:26:52,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-03-17 05:26:52,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2025-03-17 05:26:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 352 states have (on average 1.2670454545454546) internal successors, (446), 356 states have internal predecessors, (446), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-17 05:26:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 602 transitions. [2025-03-17 05:26:52,255 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 602 transitions. Word has length 109 [2025-03-17 05:26:52,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:52,255 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 602 transitions. [2025-03-17 05:26:52,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:26:52,256 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 602 transitions. [2025-03-17 05:26:52,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:26:52,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:52,257 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:52,268 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:26:52,462 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,SelfDestructingSolverStorable13 [2025-03-17 05:26:52,462 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:52,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:52,463 INFO L85 PathProgramCache]: Analyzing trace with hash 289515611, now seen corresponding path program 1 times [2025-03-17 05:26:52,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:52,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694626719] [2025-03-17 05:26:52,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:52,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:52,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:26:52,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:26:52,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:52,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:26:56,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:56,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694626719] [2025-03-17 05:26:56,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694626719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:56,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:56,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-17 05:26:56,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394165888] [2025-03-17 05:26:56,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:56,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 05:26:56,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:56,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 05:26:56,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:26:56,975 INFO L87 Difference]: Start difference. First operand 445 states and 602 transitions. Second operand has 21 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 21 states have internal predecessors, (44), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-17 05:27:03,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:27:10,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:27:11,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:11,342 INFO L93 Difference]: Finished difference Result 1160 states and 1563 transitions. [2025-03-17 05:27:11,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 05:27:11,343 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 21 states have internal predecessors, (44), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 5 states have call successors, (14) Word has length 111 [2025-03-17 05:27:11,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:11,346 INFO L225 Difference]: With dead ends: 1160 [2025-03-17 05:27:11,346 INFO L226 Difference]: Without dead ends: 914 [2025-03-17 05:27:11,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=285, Invalid=1607, Unknown=0, NotChecked=0, Total=1892 [2025-03-17 05:27:11,348 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 714 mSDsluCounter, 2150 mSDsCounter, 0 mSdLazyCounter, 3138 mSolverCounterSat, 132 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 2381 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 3138 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:11,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 2381 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 3138 Invalid, 1 Unknown, 0 Unchecked, 11.5s Time] [2025-03-17 05:27:11,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-03-17 05:27:11,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 595. [2025-03-17 05:27:11,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 473 states have (on average 1.2684989429175475) internal successors, (600), 479 states have internal predecessors, (600), 102 states have call successors, (102), 19 states have call predecessors, (102), 19 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-17 05:27:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 804 transitions. [2025-03-17 05:27:11,407 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 804 transitions. Word has length 111 [2025-03-17 05:27:11,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:11,407 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 804 transitions. [2025-03-17 05:27:11,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 21 states have internal predecessors, (44), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-17 05:27:11,408 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 804 transitions. [2025-03-17 05:27:11,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:27:11,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:11,409 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:11,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:27:11,409 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:11,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:11,409 INFO L85 PathProgramCache]: Analyzing trace with hash 500866524, now seen corresponding path program 1 times [2025-03-17 05:27:11,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:11,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366701628] [2025-03-17 05:27:11,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:11,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:11,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:27:11,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:27:11,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:11,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:27:11,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:11,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366701628] [2025-03-17 05:27:11,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366701628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:11,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:11,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:27:11,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22892033] [2025-03-17 05:27:11,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:11,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:27:11,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:11,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:27:11,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:27:11,532 INFO L87 Difference]: Start difference. First operand 595 states and 804 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:27:11,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:11,825 INFO L93 Difference]: Finished difference Result 995 states and 1346 transitions. [2025-03-17 05:27:11,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:27:11,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-03-17 05:27:11,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:11,830 INFO L225 Difference]: With dead ends: 995 [2025-03-17 05:27:11,830 INFO L226 Difference]: Without dead ends: 749 [2025-03-17 05:27:11,831 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:27:11,832 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 68 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:11,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 480 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:27:11,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2025-03-17 05:27:11,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 596. [2025-03-17 05:27:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 474 states have (on average 1.2658227848101267) internal successors, (600), 480 states have internal predecessors, (600), 102 states have call successors, (102), 19 states have call predecessors, (102), 19 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-17 05:27:11,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 804 transitions. [2025-03-17 05:27:11,915 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 804 transitions. Word has length 111 [2025-03-17 05:27:11,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:11,916 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 804 transitions. [2025-03-17 05:27:11,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:27:11,916 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 804 transitions. [2025-03-17 05:27:11,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:27:11,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:11,917 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:11,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:27:11,917 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:11,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:11,918 INFO L85 PathProgramCache]: Analyzing trace with hash 209519714, now seen corresponding path program 1 times [2025-03-17 05:27:11,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:11,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695743484] [2025-03-17 05:27:11,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:11,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:11,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:27:11,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:27:11,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:11,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:12,250 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:27:12,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:12,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695743484] [2025-03-17 05:27:12,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695743484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:12,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:12,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:27:12,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562687026] [2025-03-17 05:27:12,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:12,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:27:12,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:12,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:27:12,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:27:12,252 INFO L87 Difference]: Start difference. First operand 596 states and 804 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:27:12,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:12,909 INFO L93 Difference]: Finished difference Result 1292 states and 1747 transitions. [2025-03-17 05:27:12,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:27:12,910 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2025-03-17 05:27:12,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:12,914 INFO L225 Difference]: With dead ends: 1292 [2025-03-17 05:27:12,914 INFO L226 Difference]: Without dead ends: 733 [2025-03-17 05:27:12,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:27:12,916 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 255 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:12,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 887 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:27:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-03-17 05:27:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 609. [2025-03-17 05:27:12,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 487 states have (on average 1.2566735112936345) internal successors, (612), 493 states have internal predecessors, (612), 102 states have call successors, (102), 19 states have call predecessors, (102), 19 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-17 05:27:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 816 transitions. [2025-03-17 05:27:13,002 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 816 transitions. Word has length 111 [2025-03-17 05:27:13,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:13,002 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 816 transitions. [2025-03-17 05:27:13,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:27:13,002 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 816 transitions. [2025-03-17 05:27:13,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:27:13,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:13,003 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:13,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:27:13,003 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:13,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:13,004 INFO L85 PathProgramCache]: Analyzing trace with hash -301014463, now seen corresponding path program 1 times [2025-03-17 05:27:13,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:13,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107558732] [2025-03-17 05:27:13,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:13,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:13,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:27:13,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:27:13,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:13,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:27:13,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:13,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107558732] [2025-03-17 05:27:13,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107558732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:13,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:13,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:27:13,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92560095] [2025-03-17 05:27:13,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:13,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:27:13,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:13,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:27:13,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:27:13,884 INFO L87 Difference]: Start difference. First operand 609 states and 816 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:27:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:15,343 INFO L93 Difference]: Finished difference Result 1175 states and 1560 transitions. [2025-03-17 05:27:15,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 05:27:15,344 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2025-03-17 05:27:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:15,348 INFO L225 Difference]: With dead ends: 1175 [2025-03-17 05:27:15,348 INFO L226 Difference]: Without dead ends: 827 [2025-03-17 05:27:15,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:27:15,350 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 632 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:15,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 924 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 05:27:15,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-03-17 05:27:15,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 622. [2025-03-17 05:27:15,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 496 states have (on average 1.247983870967742) internal successors, (619), 502 states have internal predecessors, (619), 104 states have call successors, (104), 21 states have call predecessors, (104), 21 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-17 05:27:15,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 827 transitions. [2025-03-17 05:27:15,448 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 827 transitions. Word has length 111 [2025-03-17 05:27:15,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:15,450 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 827 transitions. [2025-03-17 05:27:15,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:27:15,450 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 827 transitions. [2025-03-17 05:27:15,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:27:15,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:15,452 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:15,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:27:15,452 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:15,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:15,453 INFO L85 PathProgramCache]: Analyzing trace with hash 531032507, now seen corresponding path program 1 times [2025-03-17 05:27:15,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:15,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551829581] [2025-03-17 05:27:15,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:15,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:15,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:27:15,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:27:15,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:15,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:15,726 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:27:15,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:15,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551829581] [2025-03-17 05:27:15,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551829581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:15,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:15,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:27:15,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172654051] [2025-03-17 05:27:15,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:15,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:27:15,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:15,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:27:15,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:27:15,727 INFO L87 Difference]: Start difference. First operand 622 states and 827 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:27:16,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:16,409 INFO L93 Difference]: Finished difference Result 1509 states and 2015 transitions. [2025-03-17 05:27:16,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:27:16,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-03-17 05:27:16,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:16,416 INFO L225 Difference]: With dead ends: 1509 [2025-03-17 05:27:16,417 INFO L226 Difference]: Without dead ends: 924 [2025-03-17 05:27:16,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:27:16,419 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 218 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:16,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 575 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:27:16,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2025-03-17 05:27:16,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 650. [2025-03-17 05:27:16,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 524 states have (on average 1.2557251908396947) internal successors, (658), 530 states have internal predecessors, (658), 104 states have call successors, (104), 21 states have call predecessors, (104), 21 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-17 05:27:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 866 transitions. [2025-03-17 05:27:16,514 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 866 transitions. Word has length 111 [2025-03-17 05:27:16,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:16,515 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 866 transitions. [2025-03-17 05:27:16,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:27:16,515 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 866 transitions. [2025-03-17 05:27:16,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:27:16,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:16,517 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:16,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:27:16,517 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:16,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:16,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1417416565, now seen corresponding path program 1 times [2025-03-17 05:27:16,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:16,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994468893] [2025-03-17 05:27:16,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:16,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:16,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:27:16,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:27:16,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:16,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:17,272 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:27:17,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:17,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994468893] [2025-03-17 05:27:17,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994468893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:17,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:17,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:27:17,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350174891] [2025-03-17 05:27:17,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:17,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:27:17,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:17,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:27:17,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:27:17,274 INFO L87 Difference]: Start difference. First operand 650 states and 866 transitions. Second operand has 10 states, 8 states have (on average 5.5) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:27:18,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:18,104 INFO L93 Difference]: Finished difference Result 1319 states and 1764 transitions. [2025-03-17 05:27:18,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:27:18,105 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 111 [2025-03-17 05:27:18,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:18,108 INFO L225 Difference]: With dead ends: 1319 [2025-03-17 05:27:18,108 INFO L226 Difference]: Without dead ends: 706 [2025-03-17 05:27:18,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:27:18,110 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 239 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:18,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 680 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:27:18,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2025-03-17 05:27:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 644. [2025-03-17 05:27:18,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 518 states have (on average 1.2413127413127414) internal successors, (643), 524 states have internal predecessors, (643), 104 states have call successors, (104), 21 states have call predecessors, (104), 21 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-17 05:27:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 851 transitions. [2025-03-17 05:27:18,207 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 851 transitions. Word has length 111 [2025-03-17 05:27:18,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:18,208 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 851 transitions. [2025-03-17 05:27:18,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:27:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 851 transitions. [2025-03-17 05:27:18,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:27:18,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:18,209 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:18,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 05:27:18,209 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:18,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:18,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2038584316, now seen corresponding path program 1 times [2025-03-17 05:27:18,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:18,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334371200] [2025-03-17 05:27:18,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:18,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:18,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:27:18,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:27:18,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:18,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:27:18,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:18,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334371200] [2025-03-17 05:27:18,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334371200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:18,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:18,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:27:18,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627522461] [2025-03-17 05:27:18,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:18,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:27:18,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:18,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:27:18,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:27:18,711 INFO L87 Difference]: Start difference. First operand 644 states and 851 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:27:19,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:19,197 INFO L93 Difference]: Finished difference Result 1099 states and 1454 transitions. [2025-03-17 05:27:19,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:27:19,198 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2025-03-17 05:27:19,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:19,201 INFO L225 Difference]: With dead ends: 1099 [2025-03-17 05:27:19,201 INFO L226 Difference]: Without dead ends: 846 [2025-03-17 05:27:19,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:27:19,203 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 113 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:19,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 962 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:27:19,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-03-17 05:27:19,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 665. [2025-03-17 05:27:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 538 states have (on average 1.2472118959107807) internal successors, (671), 544 states have internal predecessors, (671), 104 states have call successors, (104), 22 states have call predecessors, (104), 22 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-17 05:27:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 879 transitions. [2025-03-17 05:27:19,279 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 879 transitions. Word has length 111 [2025-03-17 05:27:19,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:19,279 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 879 transitions. [2025-03-17 05:27:19,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:27:19,279 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 879 transitions. [2025-03-17 05:27:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:27:19,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:19,280 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:19,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:27:19,280 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:19,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:19,281 INFO L85 PathProgramCache]: Analyzing trace with hash 475438282, now seen corresponding path program 1 times [2025-03-17 05:27:19,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:19,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257606573] [2025-03-17 05:27:19,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:19,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:19,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:27:19,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:27:19,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:19,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:19,470 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:27:19,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:19,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257606573] [2025-03-17 05:27:19,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257606573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:19,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:19,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:27:19,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773618747] [2025-03-17 05:27:19,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:19,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:27:19,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:19,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:27:19,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:27:19,472 INFO L87 Difference]: Start difference. First operand 665 states and 879 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:27:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:19,786 INFO L93 Difference]: Finished difference Result 1291 states and 1707 transitions. [2025-03-17 05:27:19,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:27:19,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 112 [2025-03-17 05:27:19,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:19,790 INFO L225 Difference]: With dead ends: 1291 [2025-03-17 05:27:19,790 INFO L226 Difference]: Without dead ends: 667 [2025-03-17 05:27:19,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:27:19,793 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 62 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 260 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:27:19,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 260 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:27:19,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-03-17 05:27:19,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2025-03-17 05:27:19,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 538 states have (on average 1.245353159851301) internal successors, (670), 544 states have internal predecessors, (670), 104 states have call successors, (104), 22 states have call predecessors, (104), 22 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-17 05:27:19,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 878 transitions. [2025-03-17 05:27:19,926 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 878 transitions. Word has length 112 [2025-03-17 05:27:19,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:19,927 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 878 transitions. [2025-03-17 05:27:19,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:27:19,927 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 878 transitions. [2025-03-17 05:27:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:27:19,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:19,928 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:19,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 05:27:19,929 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:19,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:19,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1096606033, now seen corresponding path program 1 times [2025-03-17 05:27:19,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:19,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924592167] [2025-03-17 05:27:19,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:19,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:19,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:27:19,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:27:19,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:19,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:20,197 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:27:20,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:20,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924592167] [2025-03-17 05:27:20,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924592167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:20,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:20,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:27:20,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315327380] [2025-03-17 05:27:20,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:20,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:27:20,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:20,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:27:20,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:27:20,205 INFO L87 Difference]: Start difference. First operand 665 states and 878 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:27:20,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:20,565 INFO L93 Difference]: Finished difference Result 1375 states and 1822 transitions. [2025-03-17 05:27:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:27:20,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2025-03-17 05:27:20,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:20,569 INFO L225 Difference]: With dead ends: 1375 [2025-03-17 05:27:20,569 INFO L226 Difference]: Without dead ends: 751 [2025-03-17 05:27:20,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:27:20,572 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 45 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:20,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 491 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:27:20,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-03-17 05:27:20,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 685. [2025-03-17 05:27:20,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 558 states have (on average 1.2473118279569892) internal successors, (696), 564 states have internal predecessors, (696), 104 states have call successors, (104), 22 states have call predecessors, (104), 22 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-17 05:27:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 904 transitions. [2025-03-17 05:27:20,715 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 904 transitions. Word has length 112 [2025-03-17 05:27:20,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:20,715 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 904 transitions. [2025-03-17 05:27:20,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:27:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 904 transitions. [2025-03-17 05:27:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:27:20,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:20,719 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:20,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 05:27:20,719 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:20,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:20,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1161660824, now seen corresponding path program 1 times [2025-03-17 05:27:20,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:20,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625934875] [2025-03-17 05:27:20,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:20,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:20,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:27:20,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:27:20,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:20,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:27:22,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:22,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625934875] [2025-03-17 05:27:22,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625934875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:22,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:22,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 05:27:22,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646988393] [2025-03-17 05:27:22,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:22,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:27:22,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:22,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:27:22,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:27:22,249 INFO L87 Difference]: Start difference. First operand 685 states and 904 transitions. Second operand has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 15 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:27:24,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:24,741 INFO L93 Difference]: Finished difference Result 895 states and 1172 transitions. [2025-03-17 05:27:24,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 05:27:24,742 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 15 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2025-03-17 05:27:24,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:24,746 INFO L225 Difference]: With dead ends: 895 [2025-03-17 05:27:24,746 INFO L226 Difference]: Without dead ends: 893 [2025-03-17 05:27:24,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2025-03-17 05:27:24,747 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 310 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:24,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 835 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 05:27:24,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2025-03-17 05:27:24,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 706. [2025-03-17 05:27:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 579 states have (on average 1.238341968911917) internal successors, (717), 585 states have internal predecessors, (717), 104 states have call successors, (104), 22 states have call predecessors, (104), 22 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-17 05:27:24,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 925 transitions. [2025-03-17 05:27:24,847 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 925 transitions. Word has length 113 [2025-03-17 05:27:24,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:24,847 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 925 transitions. [2025-03-17 05:27:24,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 15 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:27:24,847 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 925 transitions. [2025-03-17 05:27:24,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:27:24,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:24,848 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:24,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 05:27:24,848 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:24,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:24,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1162584345, now seen corresponding path program 1 times [2025-03-17 05:27:24,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:24,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510434626] [2025-03-17 05:27:24,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:24,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:24,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:27:24,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:27:24,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:24,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:25,187 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:27:25,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:25,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510434626] [2025-03-17 05:27:25,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510434626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:25,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:25,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:27:25,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648334397] [2025-03-17 05:27:25,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:25,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:27:25,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:25,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:27:25,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:27:25,189 INFO L87 Difference]: Start difference. First operand 706 states and 925 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:27:25,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:25,511 INFO L93 Difference]: Finished difference Result 1399 states and 1819 transitions. [2025-03-17 05:27:25,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:27:25,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2025-03-17 05:27:25,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:25,515 INFO L225 Difference]: With dead ends: 1399 [2025-03-17 05:27:25,515 INFO L226 Difference]: Without dead ends: 734 [2025-03-17 05:27:25,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:27:25,518 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 71 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:25,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 413 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:27:25,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-03-17 05:27:25,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 726. [2025-03-17 05:27:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 595 states have (on average 1.2201680672268909) internal successors, (726), 601 states have internal predecessors, (726), 102 states have call successors, (102), 28 states have call predecessors, (102), 28 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-17 05:27:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 930 transitions. [2025-03-17 05:27:25,663 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 930 transitions. Word has length 113 [2025-03-17 05:27:25,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:25,664 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 930 transitions. [2025-03-17 05:27:25,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:27:25,665 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 930 transitions. [2025-03-17 05:27:25,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:27:25,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:25,666 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:25,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 05:27:25,666 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:25,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:25,667 INFO L85 PathProgramCache]: Analyzing trace with hash 2050088026, now seen corresponding path program 1 times [2025-03-17 05:27:25,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:25,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658050740] [2025-03-17 05:27:25,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:25,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:25,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:27:25,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:27:25,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:25,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:25,969 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 05:27:25,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:25,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658050740] [2025-03-17 05:27:25,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658050740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:27:25,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061663941] [2025-03-17 05:27:25,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:25,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:27:25,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:27:25,973 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:27:25,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:27:26,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:27:26,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:27:26,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:26,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:26,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 05:27:26,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:26,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:27:26,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 [2025-03-17 05:27:26,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 34 [2025-03-17 05:27:26,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-17 05:27:26,415 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:27:26,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:27:26,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061663941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:26,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:27:26,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-03-17 05:27:26,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300731079] [2025-03-17 05:27:26,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:26,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:27:26,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:26,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:27:26,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:27:26,416 INFO L87 Difference]: Start difference. First operand 726 states and 930 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:27:26,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:26,820 INFO L93 Difference]: Finished difference Result 1355 states and 1738 transitions. [2025-03-17 05:27:26,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:27:26,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2025-03-17 05:27:26,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:26,825 INFO L225 Difference]: With dead ends: 1355 [2025-03-17 05:27:26,825 INFO L226 Difference]: Without dead ends: 995 [2025-03-17 05:27:26,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:27:26,827 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 198 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:26,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 780 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:27:26,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2025-03-17 05:27:26,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 632. [2025-03-17 05:27:26,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 533 states have (on average 1.2326454033771106) internal successors, (657), 537 states have internal predecessors, (657), 76 states have call successors, (76), 22 states have call predecessors, (76), 22 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:27:26,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 809 transitions. [2025-03-17 05:27:26,919 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 809 transitions. Word has length 113 [2025-03-17 05:27:26,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:26,919 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 809 transitions. [2025-03-17 05:27:26,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:27:26,920 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 809 transitions. [2025-03-17 05:27:26,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:27:26,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:26,921 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:26,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 05:27:27,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:27:27,121 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:27,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:27,122 INFO L85 PathProgramCache]: Analyzing trace with hash -189080232, now seen corresponding path program 1 times [2025-03-17 05:27:27,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:27,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609572601] [2025-03-17 05:27:27,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:27,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:27,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:27:27,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:27:27,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:27,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:27:27,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:27,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609572601] [2025-03-17 05:27:27,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609572601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:27,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:27,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:27:27,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206255712] [2025-03-17 05:27:27,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:27,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:27:27,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:27,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:27:27,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:27:27,461 INFO L87 Difference]: Start difference. First operand 632 states and 809 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:27:28,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:28,081 INFO L93 Difference]: Finished difference Result 1181 states and 1515 transitions. [2025-03-17 05:27:28,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:27:28,082 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-03-17 05:27:28,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:28,085 INFO L225 Difference]: With dead ends: 1181 [2025-03-17 05:27:28,085 INFO L226 Difference]: Without dead ends: 767 [2025-03-17 05:27:28,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:27:28,086 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 329 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:28,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 597 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:27:28,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2025-03-17 05:27:28,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 628. [2025-03-17 05:27:28,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 529 states have (on average 1.22117202268431) internal successors, (646), 533 states have internal predecessors, (646), 76 states have call successors, (76), 22 states have call predecessors, (76), 22 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:27:28,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 798 transitions. [2025-03-17 05:27:28,152 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 798 transitions. Word has length 114 [2025-03-17 05:27:28,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:28,152 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 798 transitions. [2025-03-17 05:27:28,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:27:28,153 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 798 transitions. [2025-03-17 05:27:28,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:27:28,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:28,153 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:28,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 05:27:28,154 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:28,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:28,154 INFO L85 PathProgramCache]: Analyzing trace with hash 515345971, now seen corresponding path program 1 times [2025-03-17 05:27:28,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:28,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784624507] [2025-03-17 05:27:28,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:28,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:28,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:27:28,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:27:28,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:28,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:28,516 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:27:28,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:28,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784624507] [2025-03-17 05:27:28,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784624507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:28,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:28,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:27:28,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843690398] [2025-03-17 05:27:28,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:28,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:27:28,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:28,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:27:28,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:27:28,518 INFO L87 Difference]: Start difference. First operand 628 states and 798 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:27:29,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:29,126 INFO L93 Difference]: Finished difference Result 1051 states and 1347 transitions. [2025-03-17 05:27:29,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:27:29,127 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-03-17 05:27:29,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:29,130 INFO L225 Difference]: With dead ends: 1051 [2025-03-17 05:27:29,130 INFO L226 Difference]: Without dead ends: 763 [2025-03-17 05:27:29,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:27:29,132 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 303 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:29,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 519 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:27:29,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-03-17 05:27:29,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 628. [2025-03-17 05:27:29,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 529 states have (on average 1.2173913043478262) internal successors, (644), 533 states have internal predecessors, (644), 76 states have call successors, (76), 22 states have call predecessors, (76), 22 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:27:29,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 796 transitions. [2025-03-17 05:27:29,200 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 796 transitions. Word has length 114 [2025-03-17 05:27:29,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:29,200 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 796 transitions. [2025-03-17 05:27:29,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:27:29,200 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 796 transitions. [2025-03-17 05:27:29,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:27:29,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:29,201 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:29,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 05:27:29,201 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:29,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:29,202 INFO L85 PathProgramCache]: Analyzing trace with hash -481726382, now seen corresponding path program 1 times [2025-03-17 05:27:29,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:29,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143342002] [2025-03-17 05:27:29,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:29,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:29,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:27:29,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:27:29,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:29,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:29,320 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:27:29,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:29,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143342002] [2025-03-17 05:27:29,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143342002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:29,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:29,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:27:29,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815834428] [2025-03-17 05:27:29,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:29,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:27:29,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:29,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:27:29,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:27:29,322 INFO L87 Difference]: Start difference. First operand 628 states and 796 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:27:29,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:29,547 INFO L93 Difference]: Finished difference Result 985 states and 1261 transitions. [2025-03-17 05:27:29,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:27:29,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2025-03-17 05:27:29,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:29,550 INFO L225 Difference]: With dead ends: 985 [2025-03-17 05:27:29,550 INFO L226 Difference]: Without dead ends: 701 [2025-03-17 05:27:29,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:27:29,551 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 26 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:29,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 271 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:27:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-03-17 05:27:29,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 633. [2025-03-17 05:27:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 534 states have (on average 1.2153558052434457) internal successors, (649), 538 states have internal predecessors, (649), 76 states have call successors, (76), 22 states have call predecessors, (76), 22 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:27:29,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 801 transitions. [2025-03-17 05:27:29,665 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 801 transitions. Word has length 114 [2025-03-17 05:27:29,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:29,665 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 801 transitions. [2025-03-17 05:27:29,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:27:29,666 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 801 transitions. [2025-03-17 05:27:29,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:27:29,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:29,667 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:29,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 05:27:29,667 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:29,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:29,667 INFO L85 PathProgramCache]: Analyzing trace with hash 572937079, now seen corresponding path program 1 times [2025-03-17 05:27:29,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:29,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394844767] [2025-03-17 05:27:29,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:29,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:29,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:27:29,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:27:29,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:29,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat