./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-71.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 afdbc11a14d78cfc3e8e425320a4468be878b1004162e6354634b69484bbf0df --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:20:24,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:20:24,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:20:24,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:20:24,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:20:24,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:20:24,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:20:24,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:20:24,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:20:24,338 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:20:24,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:20:24,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:20:24,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:20:24,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:20:24,339 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:20:24,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:20:24,339 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:20:24,340 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:20:24,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:20:24,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:20:24,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:20:24,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:20:24,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:20:24,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:20:24,340 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:20:24,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:20:24,340 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:20:24,340 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:20:24,340 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:20:24,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:20:24,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:20:24,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:20:24,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:20:24,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:20:24,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:20:24,341 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:20:24,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:20:24,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:20:24,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:20:24,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:20:24,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:20:24,342 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:20:24,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:20:24,342 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 -> afdbc11a14d78cfc3e8e425320a4468be878b1004162e6354634b69484bbf0df [2025-03-08 16:20:24,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:20:24,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:20:24,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:20:24,594 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:20:24,594 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:20:24,595 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-71.i [2025-03-08 16:20:25,772 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4384ea5a4/562791a66bf74b5e8bffcdbd8d03feb1/FLAG6f9c6aa00 [2025-03-08 16:20:26,011 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:20:26,012 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-71.i [2025-03-08 16:20:26,019 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4384ea5a4/562791a66bf74b5e8bffcdbd8d03feb1/FLAG6f9c6aa00 [2025-03-08 16:20:26,333 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4384ea5a4/562791a66bf74b5e8bffcdbd8d03feb1 [2025-03-08 16:20:26,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:20:26,337 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:20:26,338 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:20:26,338 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:20:26,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:20:26,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:20:26" (1/1) ... [2025-03-08 16:20:26,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f99ca09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:26, skipping insertion in model container [2025-03-08 16:20:26,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:20:26" (1/1) ... [2025-03-08 16:20:26,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:20:26,459 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-71.i[916,929] [2025-03-08 16:20:26,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:20:26,539 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:20:26,550 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-71.i[916,929] [2025-03-08 16:20:26,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:20:26,608 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:20:26,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:26 WrapperNode [2025-03-08 16:20:26,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:20:26,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:20:26,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:20:26,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:20:26,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:26" (1/1) ... [2025-03-08 16:20:26,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:26" (1/1) ... [2025-03-08 16:20:26,671 INFO L138 Inliner]: procedures = 26, calls = 173, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2025-03-08 16:20:26,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:20:26,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:20:26,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:20:26,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:20:26,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:26" (1/1) ... [2025-03-08 16:20:26,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:26" (1/1) ... [2025-03-08 16:20:26,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:26" (1/1) ... [2025-03-08 16:20:26,716 INFO L175 MemorySlicer]: Split 138 memory accesses to 6 slices as follows [2, 20, 16, 85, 7, 8]. 62 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 3, 5, 1, 2]. The 18 writes are split as follows [0, 3, 3, 8, 1, 3]. [2025-03-08 16:20:26,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:26" (1/1) ... [2025-03-08 16:20:26,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:26" (1/1) ... [2025-03-08 16:20:26,733 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:26" (1/1) ... [2025-03-08 16:20:26,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:26" (1/1) ... [2025-03-08 16:20:26,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:26" (1/1) ... [2025-03-08 16:20:26,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:26" (1/1) ... [2025-03-08 16:20:26,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:20:26,748 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:20:26,748 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:20:26,748 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:20:26,750 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:26" (1/1) ... [2025-03-08 16:20:26,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:20:26,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:20:26,774 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:20:26,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:20:26,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:20:26,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:20:26,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:20:26,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:20:26,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:20:26,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:20:26,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 16:20:26,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:20:26,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:20:26,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:20:26,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:20:26,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:20:26,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 16:20:26,795 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:20:26,795 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:20:26,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:20:26,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:20:26,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:20:26,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:20:26,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:20:26,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 16:20:26,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:20:26,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:20:26,887 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:20:26,889 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:20:27,235 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~mem75#1;havoc property_#t~ite103#1;havoc property_#t~mem89#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem81#1;havoc property_#t~ite88#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem87#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~short92#1;havoc property_#t~ite102#1;havoc property_#t~mem94#1;havoc property_#t~mem93#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem100#1;havoc property_#t~mem104#1;havoc property_#t~ite113#1;havoc property_#t~mem109#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~short114#1;havoc property_#t~mem122#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite121#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~ite130#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1; [2025-03-08 16:20:27,264 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-03-08 16:20:27,264 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:20:27,276 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:20:27,276 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:20:27,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:20:27 BoogieIcfgContainer [2025-03-08 16:20:27,276 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:20:27,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:20:27,280 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:20:27,283 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:20:27,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:20:26" (1/3) ... [2025-03-08 16:20:27,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e91afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:20:27, skipping insertion in model container [2025-03-08 16:20:27,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:26" (2/3) ... [2025-03-08 16:20:27,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e91afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:20:27, skipping insertion in model container [2025-03-08 16:20:27,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:20:27" (3/3) ... [2025-03-08 16:20:27,286 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-71.i [2025-03-08 16:20:27,298 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:20:27,299 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-71.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:20:27,342 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:20:27,351 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;@29dc3433, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:20:27,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:20:27,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 83 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 16:20:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 16:20:27,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:27,364 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:27,364 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:27,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:27,369 INFO L85 PathProgramCache]: Analyzing trace with hash 248340166, now seen corresponding path program 1 times [2025-03-08 16:20:27,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:27,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059241389] [2025-03-08 16:20:27,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:27,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:27,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 16:20:27,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 16:20:27,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:27,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:27,642 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-08 16:20:27,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:27,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059241389] [2025-03-08 16:20:27,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059241389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:20:27,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980028130] [2025-03-08 16:20:27,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:27,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:20:27,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:20:27,647 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:20:27,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:20:27,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 16:20:27,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 16:20:27,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:27,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:27,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:20:27,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:20:27,886 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-08 16:20:27,887 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:20:27,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980028130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:27,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:20:27,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:20:27,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25340862] [2025-03-08 16:20:27,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:27,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:20:27,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:27,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:20:27,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:20:27,915 INFO L87 Difference]: Start difference. First operand has 104 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 83 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:27,945 INFO L93 Difference]: Finished difference Result 202 states and 316 transitions. [2025-03-08 16:20:27,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:20:27,947 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 144 [2025-03-08 16:20:27,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:27,952 INFO L225 Difference]: With dead ends: 202 [2025-03-08 16:20:27,952 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 16:20:27,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:20:27,956 INFO L435 NwaCegarLoop]: 144 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, 144 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:27,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:20:27,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 16:20:27,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-08 16:20:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 16:20:27,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2025-03-08 16:20:27,990 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 144 transitions. Word has length 144 [2025-03-08 16:20:27,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:27,991 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 144 transitions. [2025-03-08 16:20:27,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2025-03-08 16:20:27,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 16:20:27,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:27,995 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:28,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:20:28,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:20:28,200 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:28,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:28,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1396385767, now seen corresponding path program 1 times [2025-03-08 16:20:28,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:28,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167361230] [2025-03-08 16:20:28,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:28,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:28,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 16:20:28,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 16:20:28,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:28,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:28,481 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:28,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:28,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167361230] [2025-03-08 16:20:28,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167361230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:28,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:28,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:20:28,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434892295] [2025-03-08 16:20:28,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:28,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:20:28,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:28,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:20:28,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:20:28,485 INFO L87 Difference]: Start difference. First operand 101 states and 144 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:28,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:28,545 INFO L93 Difference]: Finished difference Result 202 states and 289 transitions. [2025-03-08 16:20:28,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:20:28,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-03-08 16:20:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:28,548 INFO L225 Difference]: With dead ends: 202 [2025-03-08 16:20:28,548 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 16:20:28,549 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-08 16:20:28,549 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 412 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-08 16:20:28,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 412 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:20:28,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 16:20:28,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-03-08 16:20:28,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 16:20:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 146 transitions. [2025-03-08 16:20:28,565 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 146 transitions. Word has length 144 [2025-03-08 16:20:28,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:28,568 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 146 transitions. [2025-03-08 16:20:28,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 146 transitions. [2025-03-08 16:20:28,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 16:20:28,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:28,571 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:28,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:20:28,571 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:28,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:28,572 INFO L85 PathProgramCache]: Analyzing trace with hash -508882086, now seen corresponding path program 1 times [2025-03-08 16:20:28,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:28,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986851996] [2025-03-08 16:20:28,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:28,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:28,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 16:20:28,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 16:20:28,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:28,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:28,727 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:28,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:28,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986851996] [2025-03-08 16:20:28,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986851996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:28,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:28,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:20:28,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528424965] [2025-03-08 16:20:28,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:28,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:20:28,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:28,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:20:28,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:20:28,731 INFO L87 Difference]: Start difference. First operand 103 states and 146 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:28,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:28,766 INFO L93 Difference]: Finished difference Result 206 states and 293 transitions. [2025-03-08 16:20:28,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:20:28,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-03-08 16:20:28,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:28,768 INFO L225 Difference]: With dead ends: 206 [2025-03-08 16:20:28,768 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 16:20:28,768 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-08 16:20:28,769 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 415 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-08 16:20:28,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 415 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:20:28,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 16:20:28,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-03-08 16:20:28,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 16:20:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 148 transitions. [2025-03-08 16:20:28,782 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 148 transitions. Word has length 144 [2025-03-08 16:20:28,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:28,783 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 148 transitions. [2025-03-08 16:20:28,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:28,783 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 148 transitions. [2025-03-08 16:20:28,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 16:20:28,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:28,787 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:28,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:20:28,787 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:28,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:28,787 INFO L85 PathProgramCache]: Analyzing trace with hash -507958565, now seen corresponding path program 1 times [2025-03-08 16:20:28,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:28,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412421551] [2025-03-08 16:20:28,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:28,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:28,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 16:20:28,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 16:20:28,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:28,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:29,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:29,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412421551] [2025-03-08 16:20:29,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412421551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:29,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:29,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:20:29,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422930380] [2025-03-08 16:20:29,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:29,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:20:29,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:29,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:20:29,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:20:29,104 INFO L87 Difference]: Start difference. First operand 105 states and 148 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:29,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:29,191 INFO L93 Difference]: Finished difference Result 266 states and 375 transitions. [2025-03-08 16:20:29,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:20:29,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-03-08 16:20:29,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:29,195 INFO L225 Difference]: With dead ends: 266 [2025-03-08 16:20:29,195 INFO L226 Difference]: Without dead ends: 164 [2025-03-08 16:20:29,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:20:29,197 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 87 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:29,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 709 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:20:29,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-08 16:20:29,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 107. [2025-03-08 16:20:29,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 16:20:29,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2025-03-08 16:20:29,208 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 144 [2025-03-08 16:20:29,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:29,209 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2025-03-08 16:20:29,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:29,209 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2025-03-08 16:20:29,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:20:29,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:29,212 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:29,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:20:29,212 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:29,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:29,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1885272533, now seen corresponding path program 1 times [2025-03-08 16:20:29,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:29,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747508722] [2025-03-08 16:20:29,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:29,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:29,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:20:29,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:20:29,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:29,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:29,619 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:29,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:29,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747508722] [2025-03-08 16:20:29,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747508722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:29,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:29,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:20:29,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368795603] [2025-03-08 16:20:29,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:29,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:20:29,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:29,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:20:29,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:20:29,621 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:29,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:29,717 INFO L93 Difference]: Finished difference Result 272 states and 384 transitions. [2025-03-08 16:20:29,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:20:29,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 145 [2025-03-08 16:20:29,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:29,720 INFO L225 Difference]: With dead ends: 272 [2025-03-08 16:20:29,720 INFO L226 Difference]: Without dead ends: 168 [2025-03-08 16:20:29,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:20:29,721 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 82 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:29,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 763 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:20:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-08 16:20:29,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 115. [2025-03-08 16:20:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 94 states have internal predecessors, (125), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 16:20:29,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2025-03-08 16:20:29,734 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 145 [2025-03-08 16:20:29,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:29,735 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2025-03-08 16:20:29,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:29,735 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2025-03-08 16:20:29,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 16:20:29,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:29,737 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:29,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:20:29,737 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:29,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:29,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1860215656, now seen corresponding path program 1 times [2025-03-08 16:20:29,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:29,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619952727] [2025-03-08 16:20:29,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:29,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:29,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 16:20:29,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 16:20:29,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:29,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:30,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:30,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619952727] [2025-03-08 16:20:30,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619952727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:30,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:30,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:20:30,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670826268] [2025-03-08 16:20:30,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:30,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:20:30,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:30,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:20:30,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:20:30,985 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:31,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:31,662 INFO L93 Difference]: Finished difference Result 386 states and 542 transitions. [2025-03-08 16:20:31,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:20:31,663 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 146 [2025-03-08 16:20:31,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:31,664 INFO L225 Difference]: With dead ends: 386 [2025-03-08 16:20:31,665 INFO L226 Difference]: Without dead ends: 274 [2025-03-08 16:20:31,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:20:31,665 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 198 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:31,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1346 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:20:31,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-08 16:20:31,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 194. [2025-03-08 16:20:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 159 states have (on average 1.3144654088050314) internal successors, (209), 160 states have internal predecessors, (209), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 16:20:31,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 273 transitions. [2025-03-08 16:20:31,693 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 273 transitions. Word has length 146 [2025-03-08 16:20:31,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:31,693 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 273 transitions. [2025-03-08 16:20:31,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:31,693 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 273 transitions. [2025-03-08 16:20:31,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 16:20:31,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:31,694 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:31,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:20:31,694 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:31,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:31,695 INFO L85 PathProgramCache]: Analyzing trace with hash -593970330, now seen corresponding path program 1 times [2025-03-08 16:20:31,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:31,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517864114] [2025-03-08 16:20:31,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:31,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:31,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 16:20:31,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 16:20:31,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:31,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:31,998 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:31,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:31,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517864114] [2025-03-08 16:20:31,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517864114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:31,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:31,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:20:31,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414556770] [2025-03-08 16:20:31,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:31,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:20:31,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:32,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:20:32,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:20:32,000 INFO L87 Difference]: Start difference. First operand 194 states and 273 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:32,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:32,094 INFO L93 Difference]: Finished difference Result 447 states and 625 transitions. [2025-03-08 16:20:32,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:20:32,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 146 [2025-03-08 16:20:32,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:32,097 INFO L225 Difference]: With dead ends: 447 [2025-03-08 16:20:32,098 INFO L226 Difference]: Without dead ends: 256 [2025-03-08 16:20:32,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:20:32,099 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 66 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:32,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 621 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:20:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-08 16:20:32,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 253. [2025-03-08 16:20:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 212 states have (on average 1.3113207547169812) internal successors, (278), 214 states have internal predecessors, (278), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 16:20:32,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 350 transitions. [2025-03-08 16:20:32,117 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 350 transitions. Word has length 146 [2025-03-08 16:20:32,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:32,118 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 350 transitions. [2025-03-08 16:20:32,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:32,118 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 350 transitions. [2025-03-08 16:20:32,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 16:20:32,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:32,119 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:32,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:20:32,119 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:32,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:32,120 INFO L85 PathProgramCache]: Analyzing trace with hash 227366162, now seen corresponding path program 1 times [2025-03-08 16:20:32,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:32,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506079907] [2025-03-08 16:20:32,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:32,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:32,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:20:32,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:20:32,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:32,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:32,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:32,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506079907] [2025-03-08 16:20:32,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506079907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:32,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:32,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:20:32,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101029186] [2025-03-08 16:20:32,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:32,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:20:32,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:32,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:20:32,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:20:32,445 INFO L87 Difference]: Start difference. First operand 253 states and 350 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:32,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:32,615 INFO L93 Difference]: Finished difference Result 547 states and 749 transitions. [2025-03-08 16:20:32,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:20:32,615 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2025-03-08 16:20:32,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:32,618 INFO L225 Difference]: With dead ends: 547 [2025-03-08 16:20:32,618 INFO L226 Difference]: Without dead ends: 297 [2025-03-08 16:20:32,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:20:32,619 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 133 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:32,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1050 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:20:32,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-08 16:20:32,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 290. [2025-03-08 16:20:32,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 246 states have (on average 1.3008130081300813) internal successors, (320), 249 states have internal predecessors, (320), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 16:20:32,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 396 transitions. [2025-03-08 16:20:32,640 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 396 transitions. Word has length 147 [2025-03-08 16:20:32,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:32,640 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 396 transitions. [2025-03-08 16:20:32,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:32,641 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 396 transitions. [2025-03-08 16:20:32,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 16:20:32,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:32,641 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:32,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:20:32,642 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:32,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:32,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1239965362, now seen corresponding path program 1 times [2025-03-08 16:20:32,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:32,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589755844] [2025-03-08 16:20:32,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:32,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:32,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:20:32,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:20:32,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:32,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:33,116 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:33,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:33,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589755844] [2025-03-08 16:20:33,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589755844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:33,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:33,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:20:33,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062007744] [2025-03-08 16:20:33,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:33,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:20:33,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:33,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:20:33,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:20:33,118 INFO L87 Difference]: Start difference. First operand 290 states and 396 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:33,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:33,419 INFO L93 Difference]: Finished difference Result 712 states and 967 transitions. [2025-03-08 16:20:33,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:20:33,421 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2025-03-08 16:20:33,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:33,423 INFO L225 Difference]: With dead ends: 712 [2025-03-08 16:20:33,423 INFO L226 Difference]: Without dead ends: 425 [2025-03-08 16:20:33,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:20:33,424 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 94 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:33,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1187 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:20:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-08 16:20:33,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2025-03-08 16:20:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 358 states have (on average 1.2849162011173185) internal successors, (460), 363 states have internal predecessors, (460), 55 states have call successors, (55), 8 states have call predecessors, (55), 8 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-08 16:20:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 570 transitions. [2025-03-08 16:20:33,444 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 570 transitions. Word has length 147 [2025-03-08 16:20:33,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:33,444 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 570 transitions. [2025-03-08 16:20:33,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:33,444 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 570 transitions. [2025-03-08 16:20:33,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 16:20:33,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:33,445 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:33,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:20:33,445 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:33,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:33,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1547450125, now seen corresponding path program 1 times [2025-03-08 16:20:33,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:33,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620429718] [2025-03-08 16:20:33,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:33,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:33,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:20:33,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:20:33,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:33,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:34,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:34,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620429718] [2025-03-08 16:20:34,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620429718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:34,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:34,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:20:34,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679401329] [2025-03-08 16:20:34,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:34,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:20:34,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:34,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:20:34,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:20:34,357 INFO L87 Difference]: Start difference. First operand 422 states and 570 transitions. Second operand has 12 states, 9 states have (on average 6.111111111111111) internal successors, (55), 12 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 16:20:35,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:35,215 INFO L93 Difference]: Finished difference Result 1000 states and 1336 transitions. [2025-03-08 16:20:35,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:20:35,216 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 6.111111111111111) internal successors, (55), 12 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 147 [2025-03-08 16:20:35,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:35,218 INFO L225 Difference]: With dead ends: 1000 [2025-03-08 16:20:35,218 INFO L226 Difference]: Without dead ends: 581 [2025-03-08 16:20:35,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:20:35,220 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 193 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:35,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1012 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:20:35,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-08 16:20:35,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 455. [2025-03-08 16:20:35,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 384 states have (on average 1.2734375) internal successors, (489), 390 states have internal predecessors, (489), 59 states have call successors, (59), 11 states have call predecessors, (59), 11 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-08 16:20:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 607 transitions. [2025-03-08 16:20:35,302 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 607 transitions. Word has length 147 [2025-03-08 16:20:35,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:35,303 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 607 transitions. [2025-03-08 16:20:35,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 6.111111111111111) internal successors, (55), 12 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 16:20:35,304 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 607 transitions. [2025-03-08 16:20:35,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 16:20:35,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:35,307 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:35,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:20:35,308 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:35,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:35,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1336099212, now seen corresponding path program 1 times [2025-03-08 16:20:35,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:35,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322997189] [2025-03-08 16:20:35,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:35,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:35,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:20:35,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:20:35,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:35,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:36,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:36,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322997189] [2025-03-08 16:20:36,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322997189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:36,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:36,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:20:36,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483664712] [2025-03-08 16:20:36,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:36,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:20:36,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:36,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:20:36,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:20:36,103 INFO L87 Difference]: Start difference. First operand 455 states and 607 transitions. Second operand has 10 states, 8 states have (on average 6.875) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:20:36,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:36,670 INFO L93 Difference]: Finished difference Result 907 states and 1214 transitions. [2025-03-08 16:20:36,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:20:36,671 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.875) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 147 [2025-03-08 16:20:36,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:36,674 INFO L225 Difference]: With dead ends: 907 [2025-03-08 16:20:36,674 INFO L226 Difference]: Without dead ends: 472 [2025-03-08 16:20:36,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:20:36,676 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 109 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:36,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 798 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:20:36,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-03-08 16:20:36,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 435. [2025-03-08 16:20:36,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 364 states have (on average 1.2692307692307692) internal successors, (462), 370 states have internal predecessors, (462), 59 states have call successors, (59), 11 states have call predecessors, (59), 11 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-08 16:20:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 580 transitions. [2025-03-08 16:20:36,726 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 580 transitions. Word has length 147 [2025-03-08 16:20:36,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:36,727 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 580 transitions. [2025-03-08 16:20:36,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.875) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:20:36,727 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 580 transitions. [2025-03-08 16:20:36,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 16:20:36,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:36,729 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:36,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:20:36,730 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:36,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:36,730 INFO L85 PathProgramCache]: Analyzing trace with hash -837243981, now seen corresponding path program 1 times [2025-03-08 16:20:36,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:36,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436623715] [2025-03-08 16:20:36,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:36,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:36,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:20:36,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:20:36,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:36,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:37,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:37,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436623715] [2025-03-08 16:20:37,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436623715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:37,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:37,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:20:37,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957422558] [2025-03-08 16:20:37,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:37,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:20:37,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:37,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:20:37,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:20:37,438 INFO L87 Difference]: Start difference. First operand 435 states and 580 transitions. Second operand has 12 states, 9 states have (on average 6.111111111111111) internal successors, (55), 12 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 16:20:38,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:38,159 INFO L93 Difference]: Finished difference Result 988 states and 1317 transitions. [2025-03-08 16:20:38,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:20:38,159 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 6.111111111111111) internal successors, (55), 12 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 147 [2025-03-08 16:20:38,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:38,162 INFO L225 Difference]: With dead ends: 988 [2025-03-08 16:20:38,162 INFO L226 Difference]: Without dead ends: 573 [2025-03-08 16:20:38,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:20:38,163 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 243 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:38,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1219 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:20:38,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-08 16:20:38,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 395. [2025-03-08 16:20:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 329 states have (on average 1.2644376899696048) internal successors, (416), 334 states have internal predecessors, (416), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-08 16:20:38,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 526 transitions. [2025-03-08 16:20:38,195 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 526 transitions. Word has length 147 [2025-03-08 16:20:38,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:38,196 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 526 transitions. [2025-03-08 16:20:38,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 6.111111111111111) internal successors, (55), 12 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 16:20:38,196 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 526 transitions. [2025-03-08 16:20:38,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 16:20:38,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:38,198 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:38,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 16:20:38,198 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:38,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:38,198 INFO L85 PathProgramCache]: Analyzing trace with hash 670307828, now seen corresponding path program 1 times [2025-03-08 16:20:38,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:38,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081113142] [2025-03-08 16:20:38,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:38,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:38,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:20:38,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:20:38,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:38,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:38,446 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:38,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:38,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081113142] [2025-03-08 16:20:38,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081113142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:38,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:38,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:20:38,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430599361] [2025-03-08 16:20:38,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:38,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:20:38,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:38,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:20:38,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:20:38,448 INFO L87 Difference]: Start difference. First operand 395 states and 526 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:38,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:38,669 INFO L93 Difference]: Finished difference Result 861 states and 1151 transitions. [2025-03-08 16:20:38,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:20:38,670 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2025-03-08 16:20:38,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:38,672 INFO L225 Difference]: With dead ends: 861 [2025-03-08 16:20:38,673 INFO L226 Difference]: Without dead ends: 486 [2025-03-08 16:20:38,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:20:38,675 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 111 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:38,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1209 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:20:38,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-03-08 16:20:38,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 473. [2025-03-08 16:20:38,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 385 states have (on average 1.2441558441558442) internal successors, (479), 391 states have internal predecessors, (479), 74 states have call successors, (74), 13 states have call predecessors, (74), 13 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 16:20:38,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 627 transitions. [2025-03-08 16:20:38,718 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 627 transitions. Word has length 147 [2025-03-08 16:20:38,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:38,718 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 627 transitions. [2025-03-08 16:20:38,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:38,718 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 627 transitions. [2025-03-08 16:20:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:20:38,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:38,721 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:38,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:20:38,722 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:38,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:38,722 INFO L85 PathProgramCache]: Analyzing trace with hash -707932241, now seen corresponding path program 1 times [2025-03-08 16:20:38,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:38,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071916091] [2025-03-08 16:20:38,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:38,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:38,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:20:38,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:20:38,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:38,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:39,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:39,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071916091] [2025-03-08 16:20:39,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071916091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:39,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:39,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:20:39,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125435570] [2025-03-08 16:20:39,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:39,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:20:39,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:39,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:20:39,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:20:39,174 INFO L87 Difference]: Start difference. First operand 473 states and 627 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:39,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:39,612 INFO L93 Difference]: Finished difference Result 1040 states and 1391 transitions. [2025-03-08 16:20:39,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:20:39,613 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 148 [2025-03-08 16:20:39,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:39,617 INFO L225 Difference]: With dead ends: 1040 [2025-03-08 16:20:39,617 INFO L226 Difference]: Without dead ends: 587 [2025-03-08 16:20:39,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:20:39,618 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 104 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:39,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1195 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:20:39,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-03-08 16:20:39,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 562. [2025-03-08 16:20:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 460 states have (on average 1.258695652173913) internal successors, (579), 467 states have internal predecessors, (579), 87 states have call successors, (87), 14 states have call predecessors, (87), 14 states have return successors, (87), 80 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 16:20:39,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 753 transitions. [2025-03-08 16:20:39,664 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 753 transitions. Word has length 148 [2025-03-08 16:20:39,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:39,665 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 753 transitions. [2025-03-08 16:20:39,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:39,665 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 753 transitions. [2025-03-08 16:20:39,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:20:39,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:39,667 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:39,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 16:20:39,667 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:39,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:39,668 INFO L85 PathProgramCache]: Analyzing trace with hash -369032846, now seen corresponding path program 1 times [2025-03-08 16:20:39,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:39,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872838894] [2025-03-08 16:20:39,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:39,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:39,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:20:39,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:20:39,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:39,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:39,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:39,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872838894] [2025-03-08 16:20:39,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872838894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:39,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:39,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:20:39,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923169904] [2025-03-08 16:20:39,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:39,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:20:39,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:39,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:20:39,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:20:39,771 INFO L87 Difference]: Start difference. First operand 562 states and 753 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:39,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:39,855 INFO L93 Difference]: Finished difference Result 1106 states and 1485 transitions. [2025-03-08 16:20:39,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:20:39,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-03-08 16:20:39,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:39,858 INFO L225 Difference]: With dead ends: 1106 [2025-03-08 16:20:39,858 INFO L226 Difference]: Without dead ends: 564 [2025-03-08 16:20:39,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:20:39,861 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 63 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:39,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 585 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:20:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-08 16:20:39,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 562. [2025-03-08 16:20:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 460 states have (on average 1.2565217391304349) internal successors, (578), 467 states have internal predecessors, (578), 87 states have call successors, (87), 14 states have call predecessors, (87), 14 states have return successors, (87), 80 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 16:20:39,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 752 transitions. [2025-03-08 16:20:39,903 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 752 transitions. Word has length 148 [2025-03-08 16:20:39,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:39,904 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 752 transitions. [2025-03-08 16:20:39,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:39,904 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 752 transitions. [2025-03-08 16:20:39,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:20:39,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:39,905 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:39,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 16:20:39,905 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:39,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:39,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1008409781, now seen corresponding path program 1 times [2025-03-08 16:20:39,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:39,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171383004] [2025-03-08 16:20:39,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:39,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:39,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:20:39,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:20:39,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:39,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:40,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:40,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171383004] [2025-03-08 16:20:40,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171383004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:40,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:40,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:20:40,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597987470] [2025-03-08 16:20:40,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:40,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:20:40,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:40,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:20:40,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:20:40,024 INFO L87 Difference]: Start difference. First operand 562 states and 752 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:40,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:40,106 INFO L93 Difference]: Finished difference Result 1106 states and 1483 transitions. [2025-03-08 16:20:40,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:20:40,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-03-08 16:20:40,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:40,109 INFO L225 Difference]: With dead ends: 1106 [2025-03-08 16:20:40,110 INFO L226 Difference]: Without dead ends: 564 [2025-03-08 16:20:40,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:20:40,111 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 67 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:40,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 580 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:20:40,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-08 16:20:40,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 562. [2025-03-08 16:20:40,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 460 states have (on average 1.2543478260869565) internal successors, (577), 467 states have internal predecessors, (577), 87 states have call successors, (87), 14 states have call predecessors, (87), 14 states have return successors, (87), 80 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 16:20:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 751 transitions. [2025-03-08 16:20:40,149 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 751 transitions. Word has length 148 [2025-03-08 16:20:40,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:40,149 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 751 transitions. [2025-03-08 16:20:40,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:40,150 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 751 transitions. [2025-03-08 16:20:40,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:20:40,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:40,151 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:40,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 16:20:40,151 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:40,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:40,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1933247818, now seen corresponding path program 1 times [2025-03-08 16:20:40,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:40,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338779187] [2025-03-08 16:20:40,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:40,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:40,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:20:40,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:20:40,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:40,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:40,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:40,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338779187] [2025-03-08 16:20:40,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338779187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:40,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:40,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:20:40,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584206318] [2025-03-08 16:20:40,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:40,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:20:40,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:40,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:20:40,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:20:40,252 INFO L87 Difference]: Start difference. First operand 562 states and 751 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:40,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:40,352 INFO L93 Difference]: Finished difference Result 1104 states and 1476 transitions. [2025-03-08 16:20:40,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:20:40,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-03-08 16:20:40,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:40,356 INFO L225 Difference]: With dead ends: 1104 [2025-03-08 16:20:40,356 INFO L226 Difference]: Without dead ends: 562 [2025-03-08 16:20:40,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:20:40,358 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 46 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:40,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 639 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:20:40,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-08 16:20:40,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 543. [2025-03-08 16:20:40,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 446 states have (on average 1.2556053811659194) internal successors, (560), 452 states have internal predecessors, (560), 83 states have call successors, (83), 13 states have call predecessors, (83), 13 states have return successors, (83), 77 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 16:20:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 726 transitions. [2025-03-08 16:20:40,410 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 726 transitions. Word has length 148 [2025-03-08 16:20:40,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:40,410 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 726 transitions. [2025-03-08 16:20:40,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:40,410 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 726 transitions. [2025-03-08 16:20:40,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 16:20:40,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:40,412 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:40,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 16:20:40,413 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:40,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:40,413 INFO L85 PathProgramCache]: Analyzing trace with hash 989514217, now seen corresponding path program 1 times [2025-03-08 16:20:40,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:40,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34343826] [2025-03-08 16:20:40,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:40,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:40,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 16:20:40,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 16:20:40,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:40,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:40,578 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:40,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:40,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34343826] [2025-03-08 16:20:40,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34343826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:40,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:40,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:20:40,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730298921] [2025-03-08 16:20:40,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:40,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:20:40,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:40,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:20:40,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:20:40,581 INFO L87 Difference]: Start difference. First operand 543 states and 726 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:40,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:40,709 INFO L93 Difference]: Finished difference Result 1079 states and 1434 transitions. [2025-03-08 16:20:40,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:20:40,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2025-03-08 16:20:40,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:40,714 INFO L225 Difference]: With dead ends: 1079 [2025-03-08 16:20:40,714 INFO L226 Difference]: Without dead ends: 539 [2025-03-08 16:20:40,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:20:40,716 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 66 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:40,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 826 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:20:40,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-08 16:20:40,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 503. [2025-03-08 16:20:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 414 states have (on average 1.2318840579710144) internal successors, (510), 420 states have internal predecessors, (510), 74 states have call successors, (74), 14 states have call predecessors, (74), 14 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 16:20:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 658 transitions. [2025-03-08 16:20:40,754 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 658 transitions. Word has length 149 [2025-03-08 16:20:40,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:40,754 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 658 transitions. [2025-03-08 16:20:40,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 658 transitions. [2025-03-08 16:20:40,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 16:20:40,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:40,756 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:40,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 16:20:40,756 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:40,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:40,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1802377972, now seen corresponding path program 1 times [2025-03-08 16:20:40,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:40,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517803801] [2025-03-08 16:20:40,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:40,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:40,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 16:20:40,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 16:20:40,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:40,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:41,052 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:41,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:41,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517803801] [2025-03-08 16:20:41,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517803801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:41,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:41,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:20:41,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959131828] [2025-03-08 16:20:41,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:41,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:20:41,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:41,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:20:41,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:20:41,054 INFO L87 Difference]: Start difference. First operand 503 states and 658 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:41,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:41,307 INFO L93 Difference]: Finished difference Result 1254 states and 1645 transitions. [2025-03-08 16:20:41,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:20:41,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2025-03-08 16:20:41,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:41,311 INFO L225 Difference]: With dead ends: 1254 [2025-03-08 16:20:41,311 INFO L226 Difference]: Without dead ends: 754 [2025-03-08 16:20:41,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:20:41,312 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 99 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:41,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 772 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:20:41,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-08 16:20:41,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 750. [2025-03-08 16:20:41,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 593 states have (on average 1.21247892074199) internal successors, (719), 601 states have internal predecessors, (719), 132 states have call successors, (132), 24 states have call predecessors, (132), 24 states have return successors, (132), 124 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-08 16:20:41,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 983 transitions. [2025-03-08 16:20:41,369 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 983 transitions. Word has length 149 [2025-03-08 16:20:41,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:41,369 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 983 transitions. [2025-03-08 16:20:41,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:41,370 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 983 transitions. [2025-03-08 16:20:41,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:20:41,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:41,371 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:41,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 16:20:41,371 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:41,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:41,372 INFO L85 PathProgramCache]: Analyzing trace with hash 619282477, now seen corresponding path program 1 times [2025-03-08 16:20:41,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:41,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578629986] [2025-03-08 16:20:41,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:41,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:41,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:20:41,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:20:41,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:41,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:42,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:42,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578629986] [2025-03-08 16:20:42,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578629986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:42,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:42,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 16:20:42,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254176051] [2025-03-08 16:20:42,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:42,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:20:42,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:42,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:20:42,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:20:42,316 INFO L87 Difference]: Start difference. First operand 750 states and 983 transitions. Second operand has 13 states, 10 states have (on average 5.8) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 16:20:43,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:43,066 INFO L93 Difference]: Finished difference Result 1661 states and 2183 transitions. [2025-03-08 16:20:43,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:20:43,067 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 5.8) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2025-03-08 16:20:43,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:43,071 INFO L225 Difference]: With dead ends: 1661 [2025-03-08 16:20:43,071 INFO L226 Difference]: Without dead ends: 914 [2025-03-08 16:20:43,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:20:43,073 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 95 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:43,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1434 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:20:43,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-03-08 16:20:43,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 781. [2025-03-08 16:20:43,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 624 states have (on average 1.2227564102564104) internal successors, (763), 632 states have internal predecessors, (763), 132 states have call successors, (132), 24 states have call predecessors, (132), 24 states have return successors, (132), 124 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-08 16:20:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1027 transitions. [2025-03-08 16:20:43,148 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1027 transitions. Word has length 150 [2025-03-08 16:20:43,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:43,148 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1027 transitions. [2025-03-08 16:20:43,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 5.8) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 16:20:43,148 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1027 transitions. [2025-03-08 16:20:43,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:20:43,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:43,150 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:43,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 16:20:43,150 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:43,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:43,151 INFO L85 PathProgramCache]: Analyzing trace with hash 108748300, now seen corresponding path program 1 times [2025-03-08 16:20:43,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:43,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169375680] [2025-03-08 16:20:43,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:43,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:43,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:20:43,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:20:43,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:43,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:43,551 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:43,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:43,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169375680] [2025-03-08 16:20:43,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169375680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:43,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:43,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:20:43,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938841860] [2025-03-08 16:20:43,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:43,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:20:43,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:43,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:20:43,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:20:43,553 INFO L87 Difference]: Start difference. First operand 781 states and 1027 transitions. Second operand has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:20:43,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:43,996 INFO L93 Difference]: Finished difference Result 1733 states and 2277 transitions. [2025-03-08 16:20:43,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:20:43,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 150 [2025-03-08 16:20:43,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:44,002 INFO L225 Difference]: With dead ends: 1733 [2025-03-08 16:20:44,003 INFO L226 Difference]: Without dead ends: 955 [2025-03-08 16:20:44,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:20:44,005 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 96 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:44,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 820 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:20:44,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-03-08 16:20:44,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 850. [2025-03-08 16:20:44,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 688 states have (on average 1.2267441860465116) internal successors, (844), 697 states have internal predecessors, (844), 136 states have call successors, (136), 25 states have call predecessors, (136), 25 states have return successors, (136), 127 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-08 16:20:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1116 transitions. [2025-03-08 16:20:44,078 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1116 transitions. Word has length 150 [2025-03-08 16:20:44,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:44,078 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1116 transitions. [2025-03-08 16:20:44,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:20:44,078 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1116 transitions. [2025-03-08 16:20:44,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:20:44,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:44,079 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:44,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 16:20:44,079 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:44,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:44,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1201568657, now seen corresponding path program 1 times [2025-03-08 16:20:44,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:44,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011921971] [2025-03-08 16:20:44,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:44,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:44,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:20:44,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:20:44,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:44,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:44,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:44,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011921971] [2025-03-08 16:20:44,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011921971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:44,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:44,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:20:44,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566988400] [2025-03-08 16:20:44,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:44,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:20:44,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:44,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:20:44,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:20:44,954 INFO L87 Difference]: Start difference. First operand 850 states and 1116 transitions. Second operand has 14 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 14 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 16:20:45,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:45,834 INFO L93 Difference]: Finished difference Result 2013 states and 2637 transitions. [2025-03-08 16:20:45,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 16:20:45,835 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 14 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2025-03-08 16:20:45,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:45,840 INFO L225 Difference]: With dead ends: 2013 [2025-03-08 16:20:45,840 INFO L226 Difference]: Without dead ends: 1166 [2025-03-08 16:20:45,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:20:45,844 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 172 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:45,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1307 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:20:45,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2025-03-08 16:20:45,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 862. [2025-03-08 16:20:45,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 700 states have (on average 1.2257142857142858) internal successors, (858), 709 states have internal predecessors, (858), 136 states have call successors, (136), 25 states have call predecessors, (136), 25 states have return successors, (136), 127 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-08 16:20:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1130 transitions. [2025-03-08 16:20:45,921 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1130 transitions. Word has length 150 [2025-03-08 16:20:45,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:45,922 INFO L471 AbstractCegarLoop]: Abstraction has 862 states and 1130 transitions. [2025-03-08 16:20:45,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 14 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 16:20:45,923 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1130 transitions. [2025-03-08 16:20:45,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:20:45,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:45,924 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:45,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 16:20:45,924 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:45,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:45,925 INFO L85 PathProgramCache]: Analyzing trace with hash -836487632, now seen corresponding path program 1 times [2025-03-08 16:20:45,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:45,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108380132] [2025-03-08 16:20:45,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:45,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:45,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:20:45,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:20:45,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:45,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:46,856 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:46,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:46,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108380132] [2025-03-08 16:20:46,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108380132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:46,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:46,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 16:20:46,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294863687] [2025-03-08 16:20:46,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:46,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:20:46,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:46,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:20:46,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:20:46,857 INFO L87 Difference]: Start difference. First operand 862 states and 1130 transitions. Second operand has 15 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-08 16:20:47,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:47,511 INFO L93 Difference]: Finished difference Result 1886 states and 2469 transitions. [2025-03-08 16:20:47,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:20:47,512 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) Word has length 150 [2025-03-08 16:20:47,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:47,515 INFO L225 Difference]: With dead ends: 1886 [2025-03-08 16:20:47,515 INFO L226 Difference]: Without dead ends: 1027 [2025-03-08 16:20:47,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:20:47,517 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 89 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:47,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1327 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:20:47,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2025-03-08 16:20:47,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 850. [2025-03-08 16:20:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 688 states have (on average 1.2238372093023255) internal successors, (842), 697 states have internal predecessors, (842), 136 states have call successors, (136), 25 states have call predecessors, (136), 25 states have return successors, (136), 127 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-08 16:20:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1114 transitions. [2025-03-08 16:20:47,593 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1114 transitions. Word has length 150 [2025-03-08 16:20:47,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:47,593 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1114 transitions. [2025-03-08 16:20:47,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-08 16:20:47,594 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1114 transitions. [2025-03-08 16:20:47,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:20:47,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:47,595 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:47,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 16:20:47,595 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:47,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:47,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1312384174, now seen corresponding path program 1 times [2025-03-08 16:20:47,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:47,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675417387] [2025-03-08 16:20:47,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:47,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:47,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:20:47,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:20:47,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:47,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:47,863 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:47,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:47,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675417387] [2025-03-08 16:20:47,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675417387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:47,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:47,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:20:47,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690520734] [2025-03-08 16:20:47,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:47,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:20:47,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:47,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:20:47,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:20:47,864 INFO L87 Difference]: Start difference. First operand 850 states and 1114 transitions. Second operand has 7 states, 5 states have (on average 11.6) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:20:48,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:48,189 INFO L93 Difference]: Finished difference Result 1752 states and 2289 transitions. [2025-03-08 16:20:48,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:20:48,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.6) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 150 [2025-03-08 16:20:48,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:48,193 INFO L225 Difference]: With dead ends: 1752 [2025-03-08 16:20:48,193 INFO L226 Difference]: Without dead ends: 905 [2025-03-08 16:20:48,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:20:48,195 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 107 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:48,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 563 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:20:48,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2025-03-08 16:20:48,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 824. [2025-03-08 16:20:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 665 states have (on average 1.219548872180451) internal successors, (811), 674 states have internal predecessors, (811), 132 states have call successors, (132), 26 states have call predecessors, (132), 26 states have return successors, (132), 123 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-08 16:20:48,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1075 transitions. [2025-03-08 16:20:48,273 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1075 transitions. Word has length 150 [2025-03-08 16:20:48,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:48,273 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1075 transitions. [2025-03-08 16:20:48,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.6) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:20:48,273 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1075 transitions. [2025-03-08 16:20:48,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:20:48,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:48,274 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:48,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 16:20:48,275 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:48,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:48,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1343403981, now seen corresponding path program 1 times [2025-03-08 16:20:48,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:48,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923459971] [2025-03-08 16:20:48,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:48,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:48,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:20:48,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:20:48,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:48,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:49,153 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:49,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:49,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923459971] [2025-03-08 16:20:49,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923459971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:49,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:49,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 16:20:49,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351585847] [2025-03-08 16:20:49,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:49,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:20:49,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:49,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:20:49,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:20:49,155 INFO L87 Difference]: Start difference. First operand 824 states and 1075 transitions. Second operand has 15 states, 12 states have (on average 4.833333333333333) internal successors, (58), 15 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 16:20:50,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:50,209 INFO L93 Difference]: Finished difference Result 1811 states and 2365 transitions. [2025-03-08 16:20:50,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:20:50,209 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.833333333333333) internal successors, (58), 15 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2025-03-08 16:20:50,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:50,213 INFO L225 Difference]: With dead ends: 1811 [2025-03-08 16:20:50,213 INFO L226 Difference]: Without dead ends: 1007 [2025-03-08 16:20:50,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-03-08 16:20:50,215 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 220 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:50,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1314 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 16:20:50,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2025-03-08 16:20:50,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 543. [2025-03-08 16:20:50,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 454 states have (on average 1.2422907488986785) internal successors, (564), 458 states have internal predecessors, (564), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 16:20:50,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 708 transitions. [2025-03-08 16:20:50,279 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 708 transitions. Word has length 150 [2025-03-08 16:20:50,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:50,280 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 708 transitions. [2025-03-08 16:20:50,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.833333333333333) internal successors, (58), 15 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 16:20:50,280 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 708 transitions. [2025-03-08 16:20:50,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:20:50,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:50,281 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:50,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 16:20:50,281 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:50,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:50,281 INFO L85 PathProgramCache]: Analyzing trace with hash 832869804, now seen corresponding path program 1 times [2025-03-08 16:20:50,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:50,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54526235] [2025-03-08 16:20:50,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:50,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:50,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:20:50,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:20:50,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:50,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:50,556 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:50,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:50,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54526235] [2025-03-08 16:20:50,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54526235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:50,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:50,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:20:50,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079448925] [2025-03-08 16:20:50,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:50,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:20:50,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:50,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:20:50,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:20:50,559 INFO L87 Difference]: Start difference. First operand 543 states and 708 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:50,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:50,936 INFO L93 Difference]: Finished difference Result 1241 states and 1616 transitions. [2025-03-08 16:20:50,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:20:50,936 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2025-03-08 16:20:50,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:50,939 INFO L225 Difference]: With dead ends: 1241 [2025-03-08 16:20:50,939 INFO L226 Difference]: Without dead ends: 701 [2025-03-08 16:20:50,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:20:50,940 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 94 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:50,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 880 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:20:50,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-03-08 16:20:51,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 543. [2025-03-08 16:20:51,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 454 states have (on average 1.2422907488986785) internal successors, (564), 458 states have internal predecessors, (564), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 16:20:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 708 transitions. [2025-03-08 16:20:51,002 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 708 transitions. Word has length 150 [2025-03-08 16:20:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:51,002 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 708 transitions. [2025-03-08 16:20:51,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:51,003 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 708 transitions. [2025-03-08 16:20:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:20:51,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:51,003 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:51,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 16:20:51,004 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:51,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:51,004 INFO L85 PathProgramCache]: Analyzing trace with hash 934579756, now seen corresponding path program 1 times [2025-03-08 16:20:51,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:51,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768539116] [2025-03-08 16:20:51,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:51,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:51,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:20:51,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:20:51,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:51,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:51,833 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:51,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:51,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768539116] [2025-03-08 16:20:51,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768539116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:51,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:51,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 16:20:51,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370934126] [2025-03-08 16:20:51,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:51,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:20:51,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:51,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:20:51,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:20:51,834 INFO L87 Difference]: Start difference. First operand 543 states and 708 transitions. Second operand has 15 states, 12 states have (on average 4.833333333333333) internal successors, (58), 15 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 16:20:52,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:52,635 INFO L93 Difference]: Finished difference Result 1241 states and 1614 transitions. [2025-03-08 16:20:52,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:20:52,636 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.833333333333333) internal successors, (58), 15 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2025-03-08 16:20:52,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:52,638 INFO L225 Difference]: With dead ends: 1241 [2025-03-08 16:20:52,638 INFO L226 Difference]: Without dead ends: 701 [2025-03-08 16:20:52,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-08 16:20:52,639 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 95 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:52,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1356 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:20:52,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-03-08 16:20:52,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 531. [2025-03-08 16:20:52,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 442 states have (on average 1.2352941176470589) internal successors, (546), 446 states have internal predecessors, (546), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 16:20:52,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 690 transitions. [2025-03-08 16:20:52,703 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 690 transitions. Word has length 150 [2025-03-08 16:20:52,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:52,703 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 690 transitions. [2025-03-08 16:20:52,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.833333333333333) internal successors, (58), 15 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 16:20:52,703 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 690 transitions. [2025-03-08 16:20:52,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:20:52,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:52,704 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:52,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 16:20:52,704 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:52,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:52,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1894670354, now seen corresponding path program 1 times [2025-03-08 16:20:52,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:52,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911751482] [2025-03-08 16:20:52,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:52,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:52,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:20:52,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:20:52,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:52,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:53,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:53,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911751482] [2025-03-08 16:20:53,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911751482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:53,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:53,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:20:53,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942352245] [2025-03-08 16:20:53,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:53,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:20:53,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:53,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:20:53,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:20:53,201 INFO L87 Difference]: Start difference. First operand 531 states and 690 transitions. Second operand has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:20:53,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:53,638 INFO L93 Difference]: Finished difference Result 1239 states and 1606 transitions. [2025-03-08 16:20:53,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:20:53,639 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 150 [2025-03-08 16:20:53,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:53,642 INFO L225 Difference]: With dead ends: 1239 [2025-03-08 16:20:53,642 INFO L226 Difference]: Without dead ends: 711 [2025-03-08 16:20:53,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:20:53,644 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 102 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:53,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 684 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:20:53,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-03-08 16:20:53,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 531. [2025-03-08 16:20:53,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 442 states have (on average 1.2262443438914028) internal successors, (542), 446 states have internal predecessors, (542), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 16:20:53,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 686 transitions. [2025-03-08 16:20:53,709 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 686 transitions. Word has length 150 [2025-03-08 16:20:53,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:53,709 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 686 transitions. [2025-03-08 16:20:53,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:20:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 686 transitions. [2025-03-08 16:20:53,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:20:53,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:53,710 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:53,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 16:20:53,710 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:53,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:53,710 INFO L85 PathProgramCache]: Analyzing trace with hash 897598001, now seen corresponding path program 1 times [2025-03-08 16:20:53,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:53,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572911583] [2025-03-08 16:20:53,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:53,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:53,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:20:53,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:20:53,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:53,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:53,868 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:53,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:53,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572911583] [2025-03-08 16:20:53,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572911583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:53,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:53,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:20:53,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849815981] [2025-03-08 16:20:53,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:53,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:20:53,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:53,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:20:53,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:20:53,870 INFO L87 Difference]: Start difference. First operand 531 states and 686 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:54,220 INFO L93 Difference]: Finished difference Result 1235 states and 1590 transitions. [2025-03-08 16:20:54,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:20:54,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-03-08 16:20:54,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:54,222 INFO L225 Difference]: With dead ends: 1235 [2025-03-08 16:20:54,222 INFO L226 Difference]: Without dead ends: 707 [2025-03-08 16:20:54,223 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-08 16:20:54,224 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 85 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:54,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 466 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:20:54,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-03-08 16:20:54,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 537. [2025-03-08 16:20:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 448 states have (on average 1.2232142857142858) internal successors, (548), 452 states have internal predecessors, (548), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 16:20:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 692 transitions. [2025-03-08 16:20:54,289 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 692 transitions. Word has length 150 [2025-03-08 16:20:54,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:54,290 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 692 transitions. [2025-03-08 16:20:54,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 692 transitions. [2025-03-08 16:20:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:20:54,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:54,291 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:54,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 16:20:54,291 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:54,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:54,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1889817486, now seen corresponding path program 1 times [2025-03-08 16:20:54,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:54,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790213830] [2025-03-08 16:20:54,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:54,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:54,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:20:54,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:20:54,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:54,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:54,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:54,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790213830] [2025-03-08 16:20:54,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790213830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:54,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:54,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:20:54,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901494914] [2025-03-08 16:20:54,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:54,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:20:54,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:54,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:20:54,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:20:54,614 INFO L87 Difference]: Start difference. First operand 537 states and 692 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:54,981 INFO L93 Difference]: Finished difference Result 1200 states and 1547 transitions. [2025-03-08 16:20:54,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:20:54,982 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2025-03-08 16:20:54,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:54,984 INFO L225 Difference]: With dead ends: 1200 [2025-03-08 16:20:54,984 INFO L226 Difference]: Without dead ends: 666 [2025-03-08 16:20:54,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:20:54,986 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 89 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:54,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1256 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:20:54,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-08 16:20:55,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 533. [2025-03-08 16:20:55,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 444 states have (on average 1.2207207207207207) internal successors, (542), 448 states have internal predecessors, (542), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 16:20:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 686 transitions. [2025-03-08 16:20:55,058 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 686 transitions. Word has length 150 [2025-03-08 16:20:55,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:55,059 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 686 transitions. [2025-03-08 16:20:55,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:55,059 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 686 transitions. [2025-03-08 16:20:55,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:20:55,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:55,060 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:55,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 16:20:55,060 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:55,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:55,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1249153717, now seen corresponding path program 1 times [2025-03-08 16:20:55,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:55,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211015481] [2025-03-08 16:20:55,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:55,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:55,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:20:55,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:20:55,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:55,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:55,762 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:55,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:55,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211015481] [2025-03-08 16:20:55,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211015481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:55,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:55,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:20:55,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396173359] [2025-03-08 16:20:55,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:55,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:20:55,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:55,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:20:55,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:20:55,764 INFO L87 Difference]: Start difference. First operand 533 states and 686 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:56,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:56,457 INFO L93 Difference]: Finished difference Result 1114 states and 1432 transitions. [2025-03-08 16:20:56,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:20:56,458 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2025-03-08 16:20:56,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:56,460 INFO L225 Difference]: With dead ends: 1114 [2025-03-08 16:20:56,460 INFO L226 Difference]: Without dead ends: 584 [2025-03-08 16:20:56,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:20:56,462 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 163 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:56,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1523 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:20:56,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-03-08 16:20:56,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 542. [2025-03-08 16:20:56,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 453 states have (on average 1.216335540838852) internal successors, (551), 457 states have internal predecessors, (551), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 16:20:56,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 695 transitions. [2025-03-08 16:20:56,535 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 695 transitions. Word has length 150 [2025-03-08 16:20:56,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:56,536 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 695 transitions. [2025-03-08 16:20:56,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:56,536 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 695 transitions. [2025-03-08 16:20:56,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 16:20:56,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:56,537 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:56,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 16:20:56,537 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:56,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:56,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1105151094, now seen corresponding path program 1 times [2025-03-08 16:20:56,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:56,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470836358] [2025-03-08 16:20:56,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:56,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:56,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:20:56,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:20:56,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:56,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:56,706 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:56,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:56,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470836358] [2025-03-08 16:20:56,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470836358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:56,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:56,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:20:56,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60675641] [2025-03-08 16:20:56,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:56,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:20:56,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:56,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:20:56,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:20:56,708 INFO L87 Difference]: Start difference. First operand 542 states and 695 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:56,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:56,857 INFO L93 Difference]: Finished difference Result 1072 states and 1375 transitions. [2025-03-08 16:20:56,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:20:56,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-03-08 16:20:56,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:56,862 INFO L225 Difference]: With dead ends: 1072 [2025-03-08 16:20:56,862 INFO L226 Difference]: Without dead ends: 533 [2025-03-08 16:20:56,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:20:56,863 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 121 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:56,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 683 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:20:56,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-08 16:20:56,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 527. [2025-03-08 16:20:56,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 438 states have (on average 1.2123287671232876) internal successors, (531), 442 states have internal predecessors, (531), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 16:20:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 675 transitions. [2025-03-08 16:20:56,950 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 675 transitions. Word has length 151 [2025-03-08 16:20:56,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:56,950 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 675 transitions. [2025-03-08 16:20:56,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:56,950 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 675 transitions. [2025-03-08 16:20:56,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 16:20:56,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:56,952 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:56,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 16:20:56,952 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:56,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:56,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1805977649, now seen corresponding path program 1 times [2025-03-08 16:20:56,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:56,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438547069] [2025-03-08 16:20:56,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:56,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:56,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:20:56,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:20:56,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:56,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:57,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:57,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438547069] [2025-03-08 16:20:57,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438547069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:57,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:57,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:20:57,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318524112] [2025-03-08 16:20:57,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:57,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:20:57,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:57,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:20:57,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:20:57,120 INFO L87 Difference]: Start difference. First operand 527 states and 675 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:57,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:57,237 INFO L93 Difference]: Finished difference Result 1043 states and 1337 transitions. [2025-03-08 16:20:57,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:20:57,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-03-08 16:20:57,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:57,240 INFO L225 Difference]: With dead ends: 1043 [2025-03-08 16:20:57,240 INFO L226 Difference]: Without dead ends: 519 [2025-03-08 16:20:57,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:20:57,241 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 117 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:57,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 542 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:20:57,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-08 16:20:57,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 517. [2025-03-08 16:20:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 428 states have (on average 1.2102803738317758) internal successors, (518), 432 states have internal predecessors, (518), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 16:20:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 662 transitions. [2025-03-08 16:20:57,318 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 662 transitions. Word has length 151 [2025-03-08 16:20:57,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:57,318 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 662 transitions. [2025-03-08 16:20:57,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:20:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 662 transitions. [2025-03-08 16:20:57,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 16:20:57,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:57,319 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:57,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 16:20:57,319 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:57,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:57,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1049625743, now seen corresponding path program 1 times [2025-03-08 16:20:57,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:57,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669616945] [2025-03-08 16:20:57,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:57,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:57,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:20:57,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:20:57,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:57,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:57,918 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:57,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:57,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669616945] [2025-03-08 16:20:57,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669616945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:57,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:57,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 16:20:57,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798247959] [2025-03-08 16:20:57,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:57,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:20:57,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:57,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:20:57,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:20:57,920 INFO L87 Difference]: Start difference. First operand 517 states and 662 transitions. Second operand has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:58,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:58,461 INFO L93 Difference]: Finished difference Result 1228 states and 1570 transitions. [2025-03-08 16:20:58,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:20:58,461 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-03-08 16:20:58,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:58,464 INFO L225 Difference]: With dead ends: 1228 [2025-03-08 16:20:58,464 INFO L226 Difference]: Without dead ends: 714 [2025-03-08 16:20:58,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:20:58,465 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 99 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:58,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1183 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:20:58,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-03-08 16:20:58,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 545. [2025-03-08 16:20:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 456 states have (on average 1.2171052631578947) internal successors, (555), 460 states have internal predecessors, (555), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 16:20:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 699 transitions. [2025-03-08 16:20:58,536 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 699 transitions. Word has length 152 [2025-03-08 16:20:58,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:58,536 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 699 transitions. [2025-03-08 16:20:58,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:58,537 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 699 transitions. [2025-03-08 16:20:58,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 16:20:58,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:58,537 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:58,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 16:20:58,537 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:58,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:58,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1737789744, now seen corresponding path program 1 times [2025-03-08 16:20:58,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:58,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760037573] [2025-03-08 16:20:58,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:58,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:58,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:20:58,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:20:58,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:58,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:58,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:58,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760037573] [2025-03-08 16:20:58,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760037573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:58,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:58,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:20:58,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074150970] [2025-03-08 16:20:58,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:58,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:20:58,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:58,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:20:58,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:20:58,886 INFO L87 Difference]: Start difference. First operand 545 states and 699 transitions. Second operand has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:59,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:59,196 INFO L93 Difference]: Finished difference Result 1243 states and 1590 transitions. [2025-03-08 16:20:59,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:20:59,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-03-08 16:20:59,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:59,199 INFO L225 Difference]: With dead ends: 1243 [2025-03-08 16:20:59,199 INFO L226 Difference]: Without dead ends: 701 [2025-03-08 16:20:59,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:20:59,200 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 83 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:59,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 829 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:20:59,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-03-08 16:20:59,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 545. [2025-03-08 16:20:59,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 456 states have (on average 1.2083333333333333) internal successors, (551), 460 states have internal predecessors, (551), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 16:20:59,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 695 transitions. [2025-03-08 16:20:59,276 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 695 transitions. Word has length 152 [2025-03-08 16:20:59,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:59,277 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 695 transitions. [2025-03-08 16:20:59,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 695 transitions. [2025-03-08 16:20:59,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 16:20:59,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:59,278 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:59,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 16:20:59,278 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:59,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:59,278 INFO L85 PathProgramCache]: Analyzing trace with hash 794889198, now seen corresponding path program 1 times [2025-03-08 16:20:59,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:59,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16901124] [2025-03-08 16:20:59,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:59,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:59,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:20:59,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:20:59,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:59,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:20:59,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:59,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16901124] [2025-03-08 16:20:59,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16901124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:59,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:20:59,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:20:59,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632708963] [2025-03-08 16:20:59,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:59,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:20:59,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:59,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:20:59,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:20:59,440 INFO L87 Difference]: Start difference. First operand 545 states and 695 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:59,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:59,785 INFO L93 Difference]: Finished difference Result 1201 states and 1529 transitions. [2025-03-08 16:20:59,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:20:59,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-03-08 16:20:59,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:59,788 INFO L225 Difference]: With dead ends: 1201 [2025-03-08 16:20:59,788 INFO L226 Difference]: Without dead ends: 659 [2025-03-08 16:20:59,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:20:59,789 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 101 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:59,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 701 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:20:59,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-03-08 16:20:59,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 519. [2025-03-08 16:20:59,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 430 states have (on average 1.2023255813953488) internal successors, (517), 434 states have internal predecessors, (517), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 16:20:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 661 transitions. [2025-03-08 16:20:59,864 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 661 transitions. Word has length 152 [2025-03-08 16:20:59,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:59,865 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 661 transitions. [2025-03-08 16:20:59,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:20:59,865 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 661 transitions. [2025-03-08 16:20:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 16:20:59,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:59,866 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:59,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 16:20:59,866 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:59,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:59,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1656168591, now seen corresponding path program 1 times [2025-03-08 16:20:59,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:59,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120248779] [2025-03-08 16:20:59,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:59,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:59,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:20:59,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:20:59,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:59,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:21:00,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:00,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120248779] [2025-03-08 16:21:00,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120248779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:00,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:00,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:21:00,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904843893] [2025-03-08 16:21:00,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:00,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:21:00,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:00,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:21:00,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:21:00,112 INFO L87 Difference]: Start difference. First operand 519 states and 661 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:21:00,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:00,440 INFO L93 Difference]: Finished difference Result 1193 states and 1520 transitions. [2025-03-08 16:21:00,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:21:00,440 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-03-08 16:21:00,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:00,443 INFO L225 Difference]: With dead ends: 1193 [2025-03-08 16:21:00,443 INFO L226 Difference]: Without dead ends: 677 [2025-03-08 16:21:00,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:21:00,444 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 115 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:00,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1835 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:21:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-03-08 16:21:00,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 657. [2025-03-08 16:21:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 524 states have (on average 1.1812977099236641) internal successors, (619), 530 states have internal predecessors, (619), 108 states have call successors, (108), 24 states have call predecessors, (108), 24 states have return successors, (108), 102 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 16:21:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 835 transitions. [2025-03-08 16:21:00,557 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 835 transitions. Word has length 152 [2025-03-08 16:21:00,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:00,557 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 835 transitions. [2025-03-08 16:21:00,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:21:00,557 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 835 transitions. [2025-03-08 16:21:00,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 16:21:00,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:00,558 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:00,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 16:21:00,558 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:00,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:00,558 INFO L85 PathProgramCache]: Analyzing trace with hash -985485601, now seen corresponding path program 1 times [2025-03-08 16:21:00,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:00,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785324751] [2025-03-08 16:21:00,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:00,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:00,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:21:00,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:21:00,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:00,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:21:01,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:01,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785324751] [2025-03-08 16:21:01,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785324751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:01,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:01,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:21:01,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3292410] [2025-03-08 16:21:01,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:01,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:21:01,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:01,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:21:01,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:21:01,027 INFO L87 Difference]: Start difference. First operand 657 states and 835 transitions. Second operand has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:21:01,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:01,416 INFO L93 Difference]: Finished difference Result 740 states and 935 transitions. [2025-03-08 16:21:01,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:21:01,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-03-08 16:21:01,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:01,419 INFO L225 Difference]: With dead ends: 740 [2025-03-08 16:21:01,419 INFO L226 Difference]: Without dead ends: 738 [2025-03-08 16:21:01,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:21:01,420 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 89 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:01,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 825 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:21:01,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-03-08 16:21:01,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 631. [2025-03-08 16:21:01,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 511 states have (on average 1.1741682974559686) internal successors, (600), 517 states have internal predecessors, (600), 95 states have call successors, (95), 24 states have call predecessors, (95), 24 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-08 16:21:01,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 790 transitions. [2025-03-08 16:21:01,546 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 790 transitions. Word has length 152 [2025-03-08 16:21:01,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:01,547 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 790 transitions. [2025-03-08 16:21:01,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:21:01,547 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 790 transitions. [2025-03-08 16:21:01,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 16:21:01,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:01,548 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:01,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 16:21:01,548 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:01,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:01,548 INFO L85 PathProgramCache]: Analyzing trace with hash -984562080, now seen corresponding path program 1 times [2025-03-08 16:21:01,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:01,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516193506] [2025-03-08 16:21:01,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:01,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:01,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:21:01,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:21:01,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:01,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:21:01,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:01,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516193506] [2025-03-08 16:21:01,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516193506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:01,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:01,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:21:01,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443395031] [2025-03-08 16:21:01,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:01,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:21:01,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:01,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:21:01,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:21:01,700 INFO L87 Difference]: Start difference. First operand 631 states and 790 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:21:01,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:01,855 INFO L93 Difference]: Finished difference Result 1224 states and 1525 transitions. [2025-03-08 16:21:01,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:21:01,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-03-08 16:21:01,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:01,858 INFO L225 Difference]: With dead ends: 1224 [2025-03-08 16:21:01,858 INFO L226 Difference]: Without dead ends: 647 [2025-03-08 16:21:01,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:21:01,859 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 67 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:01,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 566 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:21:01,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-03-08 16:21:01,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2025-03-08 16:21:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 523 states have (on average 1.158699808795411) internal successors, (606), 529 states have internal predecessors, (606), 95 states have call successors, (95), 28 states have call predecessors, (95), 28 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-08 16:21:01,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 796 transitions. [2025-03-08 16:21:01,985 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 796 transitions. Word has length 152 [2025-03-08 16:21:01,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:01,985 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 796 transitions. [2025-03-08 16:21:01,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:21:01,986 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 796 transitions. [2025-03-08 16:21:01,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 16:21:01,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:01,986 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:01,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 16:21:01,986 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:01,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:01,987 INFO L85 PathProgramCache]: Analyzing trace with hash -97058399, now seen corresponding path program 1 times [2025-03-08 16:21:01,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:01,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657179379] [2025-03-08 16:21:01,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:01,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:01,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:21:02,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:21:02,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:02,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:02,069 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-08 16:21:02,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:02,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657179379] [2025-03-08 16:21:02,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657179379] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:21:02,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306806421] [2025-03-08 16:21:02,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:02,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:21:02,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:21:02,071 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:21:02,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:21:02,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:21:02,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:21:02,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:02,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:02,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:21:02,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:21:02,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:21:02,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306806421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:02,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:21:02,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-08 16:21:02,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483481727] [2025-03-08 16:21:02,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:02,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:21:02,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:02,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:21:02,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:21:02,249 INFO L87 Difference]: Start difference. First operand 647 states and 796 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:21:02,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:02,426 INFO L93 Difference]: Finished difference Result 1258 states and 1549 transitions. [2025-03-08 16:21:02,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:21:02,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-03-08 16:21:02,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:02,430 INFO L225 Difference]: With dead ends: 1258 [2025-03-08 16:21:02,430 INFO L226 Difference]: Without dead ends: 665 [2025-03-08 16:21:02,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:21:02,431 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:02,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 541 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:21:02,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-08 16:21:02,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2025-03-08 16:21:02,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 541 states have (on average 1.1534195933456561) internal successors, (624), 547 states have internal predecessors, (624), 95 states have call successors, (95), 28 states have call predecessors, (95), 28 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-08 16:21:02,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 814 transitions. [2025-03-08 16:21:02,564 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 814 transitions. Word has length 152 [2025-03-08 16:21:02,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:02,564 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 814 transitions. [2025-03-08 16:21:02,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:21:02,564 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 814 transitions. [2025-03-08 16:21:02,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 16:21:02,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:02,565 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:02,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 16:21:02,765 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,SelfDestructingSolverStorable39 [2025-03-08 16:21:02,766 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:02,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:02,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1466836995, now seen corresponding path program 1 times [2025-03-08 16:21:02,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:02,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386704820] [2025-03-08 16:21:02,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:02,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:02,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 16:21:02,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 16:21:02,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:02,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:21:03,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:03,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386704820] [2025-03-08 16:21:03,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386704820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:03,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:03,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:21:03,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228875179] [2025-03-08 16:21:03,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:03,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:21:03,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:03,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:21:03,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:21:03,183 INFO L87 Difference]: Start difference. First operand 665 states and 814 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:21:03,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:03,765 INFO L93 Difference]: Finished difference Result 1744 states and 2123 transitions. [2025-03-08 16:21:03,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:21:03,765 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 154 [2025-03-08 16:21:03,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:03,769 INFO L225 Difference]: With dead ends: 1744 [2025-03-08 16:21:03,769 INFO L226 Difference]: Without dead ends: 1133 [2025-03-08 16:21:03,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:21:03,770 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 85 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:03,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 577 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:21:03,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2025-03-08 16:21:03,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 817. [2025-03-08 16:21:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 693 states have (on average 1.15007215007215) internal successors, (797), 699 states have internal predecessors, (797), 95 states have call successors, (95), 28 states have call predecessors, (95), 28 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-08 16:21:03,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 987 transitions. [2025-03-08 16:21:03,909 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 987 transitions. Word has length 154 [2025-03-08 16:21:03,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:03,909 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 987 transitions. [2025-03-08 16:21:03,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:21:03,909 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 987 transitions. [2025-03-08 16:21:03,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 16:21:03,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:03,910 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:03,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 16:21:03,910 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:03,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:03,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1173433988, now seen corresponding path program 1 times [2025-03-08 16:21:03,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:03,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352549450] [2025-03-08 16:21:03,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:03,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:03,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 16:21:03,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 16:21:03,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:03,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:04,393 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:21:04,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:04,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352549450] [2025-03-08 16:21:04,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352549450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:04,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:04,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:21:04,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462044315] [2025-03-08 16:21:04,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:04,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:21:04,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:04,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:21:04,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:21:04,394 INFO L87 Difference]: Start difference. First operand 817 states and 987 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:21:04,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:04,842 INFO L93 Difference]: Finished difference Result 1818 states and 2187 transitions. [2025-03-08 16:21:04,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:21:04,843 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 154 [2025-03-08 16:21:04,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:04,847 INFO L225 Difference]: With dead ends: 1818 [2025-03-08 16:21:04,847 INFO L226 Difference]: Without dead ends: 1055 [2025-03-08 16:21:04,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:21:04,849 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 68 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:04,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 823 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:21:04,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2025-03-08 16:21:05,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1045. [2025-03-08 16:21:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 853 states have (on average 1.1219226260257913) internal successors, (957), 865 states have internal predecessors, (957), 147 states have call successors, (147), 44 states have call predecessors, (147), 44 states have return successors, (147), 135 states have call predecessors, (147), 147 states have call successors, (147) [2025-03-08 16:21:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1251 transitions. [2025-03-08 16:21:05,089 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1251 transitions. Word has length 154 [2025-03-08 16:21:05,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:05,090 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1251 transitions. [2025-03-08 16:21:05,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:21:05,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1251 transitions. [2025-03-08 16:21:05,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 16:21:05,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:05,091 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:05,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 16:21:05,091 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:05,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:05,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1212100450, now seen corresponding path program 1 times [2025-03-08 16:21:05,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:05,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546545267] [2025-03-08 16:21:05,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:05,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:05,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 16:21:05,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 16:21:05,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:05,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:05,520 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:21:05,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:05,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546545267] [2025-03-08 16:21:05,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546545267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:05,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:05,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:21:05,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906998840] [2025-03-08 16:21:05,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:05,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:21:05,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:05,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:21:05,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:21:05,523 INFO L87 Difference]: Start difference. First operand 1045 states and 1251 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:21:06,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:06,193 INFO L93 Difference]: Finished difference Result 2486 states and 2964 transitions. [2025-03-08 16:21:06,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:21:06,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 154 [2025-03-08 16:21:06,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:06,198 INFO L225 Difference]: With dead ends: 2486 [2025-03-08 16:21:06,198 INFO L226 Difference]: Without dead ends: 1495 [2025-03-08 16:21:06,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:21:06,200 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 78 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:06,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 635 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:21:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2025-03-08 16:21:06,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1261. [2025-03-08 16:21:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1068 states have (on average 1.1338951310861423) internal successors, (1211), 1080 states have internal predecessors, (1211), 147 states have call successors, (147), 45 states have call predecessors, (147), 45 states have return successors, (147), 135 states have call predecessors, (147), 147 states have call successors, (147) [2025-03-08 16:21:06,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1505 transitions. [2025-03-08 16:21:06,453 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1505 transitions. Word has length 154 [2025-03-08 16:21:06,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:06,455 INFO L471 AbstractCegarLoop]: Abstraction has 1261 states and 1505 transitions. [2025-03-08 16:21:06,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:21:06,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1505 transitions. [2025-03-08 16:21:06,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 16:21:06,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:06,456 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:06,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 16:21:06,456 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:06,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:06,456 INFO L85 PathProgramCache]: Analyzing trace with hash 918697443, now seen corresponding path program 1 times [2025-03-08 16:21:06,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:06,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458564463] [2025-03-08 16:21:06,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:06,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:06,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 16:21:06,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 16:21:06,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:06,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:21:07,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:07,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458564463] [2025-03-08 16:21:07,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458564463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:07,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:07,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:21:07,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256361278] [2025-03-08 16:21:07,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:07,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:21:07,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:07,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:21:07,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:21:07,085 INFO L87 Difference]: Start difference. First operand 1261 states and 1505 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:21:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:08,044 INFO L93 Difference]: Finished difference Result 2794 states and 3329 transitions. [2025-03-08 16:21:08,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:21:08,044 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 154 [2025-03-08 16:21:08,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:08,049 INFO L225 Difference]: With dead ends: 2794 [2025-03-08 16:21:08,049 INFO L226 Difference]: Without dead ends: 1591 [2025-03-08 16:21:08,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:21:08,051 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 175 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:08,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1176 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:21:08,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2025-03-08 16:21:08,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1291. [2025-03-08 16:21:08,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1098 states have (on average 1.1311475409836065) internal successors, (1242), 1110 states have internal predecessors, (1242), 147 states have call successors, (147), 45 states have call predecessors, (147), 45 states have return successors, (147), 135 states have call predecessors, (147), 147 states have call successors, (147) [2025-03-08 16:21:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1536 transitions. [2025-03-08 16:21:08,305 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1536 transitions. Word has length 154 [2025-03-08 16:21:08,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:08,306 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1536 transitions. [2025-03-08 16:21:08,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:21:08,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1536 transitions. [2025-03-08 16:21:08,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 16:21:08,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:08,307 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:08,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 16:21:08,307 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:08,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:08,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1165504609, now seen corresponding path program 1 times [2025-03-08 16:21:08,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:08,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047241623] [2025-03-08 16:21:08,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:08,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:08,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 16:21:08,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 16:21:08,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:08,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:21:08,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:08,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047241623] [2025-03-08 16:21:08,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047241623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:08,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:08,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:21:08,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886102427] [2025-03-08 16:21:08,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:08,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:21:08,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:08,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:21:08,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:21:08,723 INFO L87 Difference]: Start difference. First operand 1291 states and 1536 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:21:09,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:09,317 INFO L93 Difference]: Finished difference Result 2873 states and 3393 transitions. [2025-03-08 16:21:09,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:21:09,317 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 154 [2025-03-08 16:21:09,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:09,322 INFO L225 Difference]: With dead ends: 2873 [2025-03-08 16:21:09,322 INFO L226 Difference]: Without dead ends: 1640 [2025-03-08 16:21:09,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:21:09,324 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 66 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:09,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 994 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:21:09,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2025-03-08 16:21:09,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1394. [2025-03-08 16:21:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1201 states have (on average 1.1207327227310575) internal successors, (1346), 1213 states have internal predecessors, (1346), 147 states have call successors, (147), 45 states have call predecessors, (147), 45 states have return successors, (147), 135 states have call predecessors, (147), 147 states have call successors, (147) [2025-03-08 16:21:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1640 transitions. [2025-03-08 16:21:09,682 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1640 transitions. Word has length 154 [2025-03-08 16:21:09,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:09,682 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1640 transitions. [2025-03-08 16:21:09,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:21:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1640 transitions. [2025-03-08 16:21:09,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:21:09,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:09,683 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:09,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-08 16:21:09,683 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:09,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:09,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1879750760, now seen corresponding path program 1 times [2025-03-08 16:21:09,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:09,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492530609] [2025-03-08 16:21:09,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:09,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:09,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:21:09,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:21:09,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:09,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:21:09,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [290521774] [2025-03-08 16:21:09,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:09,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:21:09,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:21:09,763 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:21:09,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 16:21:09,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:21:10,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:21:10,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:10,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:10,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-08 16:21:10,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:10,272 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 19 treesize of output 1 [2025-03-08 16:21:10,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:21:10,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:21:10,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:21:10,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:21:10,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2025-03-08 16:21:10,415 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 17 treesize of output 13 [2025-03-08 16:21:10,422 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 17 treesize of output 17 [2025-03-08 16:21:10,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:21:10,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 44 [2025-03-08 16:21:10,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 65 treesize of output 41 [2025-03-08 16:21:10,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:21:10,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 37 [2025-03-08 16:21:10,995 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-08 16:21:10,995 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:21:10,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:10,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492530609] [2025-03-08 16:21:10,996 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 16:21:10,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290521774] [2025-03-08 16:21:10,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290521774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:10,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:10,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:21:10,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702617940] [2025-03-08 16:21:10,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:10,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:21:10,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:10,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:21:10,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:21:10,999 INFO L87 Difference]: Start difference. First operand 1394 states and 1640 transitions. Second operand has 12 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:21:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:13,013 INFO L93 Difference]: Finished difference Result 3307 states and 3860 transitions. [2025-03-08 16:21:13,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 16:21:13,014 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-03-08 16:21:13,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:13,019 INFO L225 Difference]: With dead ends: 3307 [2025-03-08 16:21:13,019 INFO L226 Difference]: Without dead ends: 1971 [2025-03-08 16:21:13,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2025-03-08 16:21:13,021 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 339 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:13,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 693 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 16:21:13,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2025-03-08 16:21:13,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1439. [2025-03-08 16:21:13,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1256 states have (on average 1.1202229299363058) internal successors, (1407), 1270 states have internal predecessors, (1407), 137 states have call successors, (137), 45 states have call predecessors, (137), 45 states have return successors, (137), 123 states have call predecessors, (137), 137 states have call successors, (137) [2025-03-08 16:21:13,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 1681 transitions. [2025-03-08 16:21:13,309 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 1681 transitions. Word has length 155 [2025-03-08 16:21:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:13,309 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 1681 transitions. [2025-03-08 16:21:13,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:21:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1681 transitions. [2025-03-08 16:21:13,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:21:13,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:13,311 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:13,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 16:21:13,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:21:13,512 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:13,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:13,512 INFO L85 PathProgramCache]: Analyzing trace with hash 82799401, now seen corresponding path program 1 times [2025-03-08 16:21:13,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:13,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333417416] [2025-03-08 16:21:13,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:13,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:13,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:21:13,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:21:13,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:13,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:13,639 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-08 16:21:13,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:13,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333417416] [2025-03-08 16:21:13,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333417416] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:21:13,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803861539] [2025-03-08 16:21:13,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:13,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:21:13,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:21:13,642 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:21:13,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 16:21:13,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:21:13,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:21:13,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:13,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:13,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:21:13,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:13,839 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:21:13,840 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:21:13,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803861539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:13,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:21:13,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-08 16:21:13,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972173815] [2025-03-08 16:21:13,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:13,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:21:13,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:13,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:21:13,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:21:13,840 INFO L87 Difference]: Start difference. First operand 1439 states and 1681 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:21:14,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:14,143 INFO L93 Difference]: Finished difference Result 2852 states and 3333 transitions. [2025-03-08 16:21:14,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:21:14,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-03-08 16:21:14,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:14,147 INFO L225 Difference]: With dead ends: 2852 [2025-03-08 16:21:14,147 INFO L226 Difference]: Without dead ends: 1459 [2025-03-08 16:21:14,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:21:14,148 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:14,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 671 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:21:14,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2025-03-08 16:21:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1417. [2025-03-08 16:21:14,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1234 states have (on average 1.1158833063209077) internal successors, (1377), 1248 states have internal predecessors, (1377), 137 states have call successors, (137), 45 states have call predecessors, (137), 45 states have return successors, (137), 123 states have call predecessors, (137), 137 states have call successors, (137) [2025-03-08 16:21:14,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1651 transitions. [2025-03-08 16:21:14,426 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1651 transitions. Word has length 155 [2025-03-08 16:21:14,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:14,427 INFO L471 AbstractCegarLoop]: Abstraction has 1417 states and 1651 transitions. [2025-03-08 16:21:14,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:21:14,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1651 transitions. [2025-03-08 16:21:14,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:21:14,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:14,428 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:14,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 16:21:14,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:21:14,629 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:14,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:14,629 INFO L85 PathProgramCache]: Analyzing trace with hash 918136743, now seen corresponding path program 1 times [2025-03-08 16:21:14,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:14,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024303390] [2025-03-08 16:21:14,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:14,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:14,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:21:14,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:21:14,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:14,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:14,842 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:21:14,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:14,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024303390] [2025-03-08 16:21:14,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024303390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:14,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:14,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:21:14,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391982971] [2025-03-08 16:21:14,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:14,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:21:14,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:14,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:21:14,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:21:14,844 INFO L87 Difference]: Start difference. First operand 1417 states and 1651 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:21:15,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:15,427 INFO L93 Difference]: Finished difference Result 4011 states and 4673 transitions. [2025-03-08 16:21:15,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:21:15,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-03-08 16:21:15,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:15,432 INFO L225 Difference]: With dead ends: 4011 [2025-03-08 16:21:15,432 INFO L226 Difference]: Without dead ends: 1321 [2025-03-08 16:21:15,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:21:15,434 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 117 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:15,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1406 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:21:15,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2025-03-08 16:21:15,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2025-03-08 16:21:15,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1144 states have (on average 1.0926573426573427) internal successors, (1250), 1157 states have internal predecessors, (1250), 133 states have call successors, (133), 43 states have call predecessors, (133), 43 states have return successors, (133), 120 states have call predecessors, (133), 133 states have call successors, (133) [2025-03-08 16:21:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1516 transitions. [2025-03-08 16:21:15,702 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1516 transitions. Word has length 155 [2025-03-08 16:21:15,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:15,702 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1516 transitions. [2025-03-08 16:21:15,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:21:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1516 transitions. [2025-03-08 16:21:15,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:21:15,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:15,704 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:15,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-08 16:21:15,704 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:15,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:15,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1952984840, now seen corresponding path program 1 times [2025-03-08 16:21:15,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:15,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907242138] [2025-03-08 16:21:15,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:15,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:15,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:21:15,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:21:15,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:15,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:21:15,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [652091311] [2025-03-08 16:21:15,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:15,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:21:15,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:21:15,774 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:21:15,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 16:21:15,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:21:16,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:21:16,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:16,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:16,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-08 16:21:16,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:16,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:21:16,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 16:21:16,170 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 19 treesize of output 1 [2025-03-08 16:21:16,187 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 19 treesize of output 1 [2025-03-08 16:21:16,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:21:16,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:21:16,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:21:16,238 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 11 treesize of output 7 [2025-03-08 16:21:16,252 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 17 treesize of output 17 [2025-03-08 16:21:16,256 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 17 treesize of output 13 [2025-03-08 16:21:16,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:21:16,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 44 [2025-03-08 16:21:16,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 65 treesize of output 41 [2025-03-08 16:21:16,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:21:16,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 32 [2025-03-08 16:21:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:21:16,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:21:16,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:16,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907242138] [2025-03-08 16:21:16,755 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 16:21:16,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652091311] [2025-03-08 16:21:16,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652091311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:16,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:16,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:21:16,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526994347] [2025-03-08 16:21:16,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:16,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:21:16,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:16,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:21:16,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:21:16,756 INFO L87 Difference]: Start difference. First operand 1321 states and 1516 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:21:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:18,532 INFO L93 Difference]: Finished difference Result 2824 states and 3238 transitions. [2025-03-08 16:21:18,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:21:18,533 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-03-08 16:21:18,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:18,537 INFO L225 Difference]: With dead ends: 2824 [2025-03-08 16:21:18,537 INFO L226 Difference]: Without dead ends: 1549 [2025-03-08 16:21:18,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:21:18,539 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 221 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:18,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 914 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 16:21:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2025-03-08 16:21:18,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1429. [2025-03-08 16:21:18,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1429 states, 1225 states have (on average 1.0840816326530611) internal successors, (1328), 1241 states have internal predecessors, (1328), 152 states have call successors, (152), 51 states have call predecessors, (152), 51 states have return successors, (152), 136 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-08 16:21:18,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1632 transitions. [2025-03-08 16:21:18,898 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 1632 transitions. Word has length 155 [2025-03-08 16:21:18,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:18,898 INFO L471 AbstractCegarLoop]: Abstraction has 1429 states and 1632 transitions. [2025-03-08 16:21:18,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:21:18,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1632 transitions. [2025-03-08 16:21:18,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 16:21:18,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:18,900 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:18,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 16:21:19,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-03-08 16:21:19,100 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:19,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:19,101 INFO L85 PathProgramCache]: Analyzing trace with hash -224140525, now seen corresponding path program 1 times [2025-03-08 16:21:19,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:19,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277710040] [2025-03-08 16:21:19,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:19,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:19,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 16:21:19,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 16:21:19,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:19,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:20,538 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 84 proven. 18 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2025-03-08 16:21:20,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:20,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277710040] [2025-03-08 16:21:20,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277710040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:21:20,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268103490] [2025-03-08 16:21:20,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:20,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:21:20,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:21:20,541 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:21:20,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 16:21:20,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 16:21:20,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 16:21:20,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:20,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:20,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-08 16:21:20,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:20,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:21:20,776 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 29 treesize of output 13 [2025-03-08 16:21:20,795 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 29 treesize of output 13 [2025-03-08 16:21:20,815 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 29 treesize of output 13 [2025-03-08 16:21:21,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:21:21,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 56 [2025-03-08 16:21:21,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:21:21,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 43 [2025-03-08 16:21:21,129 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 369 proven. 18 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-08 16:21:21,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:21:21,908 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 84 proven. 21 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-03-08 16:21:21,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268103490] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:21:21,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:21:21,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15, 18] total 47 [2025-03-08 16:21:21,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780441901] [2025-03-08 16:21:21,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:21:21,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-08 16:21:21,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:21,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-08 16:21:21,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1867, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 16:21:21,910 INFO L87 Difference]: Start difference. First operand 1429 states and 1632 transitions. Second operand has 47 states, 40 states have (on average 3.475) internal successors, (139), 47 states have internal predecessors, (139), 14 states have call successors, (46), 2 states have call predecessors, (46), 6 states have return successors, (46), 10 states have call predecessors, (46), 14 states have call successors, (46) [2025-03-08 16:21:26,321 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-08 16:21:30,504 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-08 16:21:33,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:33,126 INFO L93 Difference]: Finished difference Result 3110 states and 3525 transitions. [2025-03-08 16:21:33,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 16:21:33,127 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 40 states have (on average 3.475) internal successors, (139), 47 states have internal predecessors, (139), 14 states have call successors, (46), 2 states have call predecessors, (46), 6 states have return successors, (46), 10 states have call predecessors, (46), 14 states have call successors, (46) Word has length 156 [2025-03-08 16:21:33,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:33,131 INFO L225 Difference]: With dead ends: 3110 [2025-03-08 16:21:33,131 INFO L226 Difference]: Without dead ends: 1727 [2025-03-08 16:21:33,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 292 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1151 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=717, Invalid=3573, Unknown=0, NotChecked=0, Total=4290 [2025-03-08 16:21:33,134 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 603 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 2221 mSolverCounterSat, 259 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 2482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 2221 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:33,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 1578 Invalid, 2482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 2221 Invalid, 2 Unknown, 0 Unchecked, 9.8s Time] [2025-03-08 16:21:33,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2025-03-08 16:21:33,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1195. [2025-03-08 16:21:33,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 1048 states have (on average 1.0830152671755726) internal successors, (1135), 1059 states have internal predecessors, (1135), 105 states have call successors, (105), 41 states have call predecessors, (105), 41 states have return successors, (105), 94 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 16:21:33,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1345 transitions. [2025-03-08 16:21:33,360 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1345 transitions. Word has length 156 [2025-03-08 16:21:33,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:33,361 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1345 transitions. [2025-03-08 16:21:33,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 40 states have (on average 3.475) internal successors, (139), 47 states have internal predecessors, (139), 14 states have call successors, (46), 2 states have call predecessors, (46), 6 states have return successors, (46), 10 states have call predecessors, (46), 14 states have call successors, (46) [2025-03-08 16:21:33,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1345 transitions. [2025-03-08 16:21:33,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 16:21:33,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:33,362 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:33,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 16:21:33,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-03-08 16:21:33,563 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:33,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:33,563 INFO L85 PathProgramCache]: Analyzing trace with hash -772280077, now seen corresponding path program 1 times [2025-03-08 16:21:33,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:33,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728493996] [2025-03-08 16:21:33,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:33,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:33,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 16:21:33,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 16:21:33,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:33,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:21:33,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [32819248] [2025-03-08 16:21:33,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:33,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:21:33,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:21:33,659 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:21:33,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 16:21:33,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 16:21:33,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 16:21:33,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:33,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:33,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-08 16:21:33,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:33,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:21:33,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 16:21:34,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:21:34,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:21:34,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:21:34,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:21:34,264 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 17 treesize of output 13 [2025-03-08 16:21:34,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2025-03-08 16:21:34,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 69 treesize of output 45 [2025-03-08 16:21:34,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:21:34,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 44 [2025-03-08 16:21:34,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:21:34,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 24 [2025-03-08 16:21:34,710 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:21:34,710 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:21:34,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:34,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728493996] [2025-03-08 16:21:34,710 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 16:21:34,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32819248] [2025-03-08 16:21:34,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32819248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:34,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:34,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:21:34,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245213587] [2025-03-08 16:21:34,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:34,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:21:34,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:34,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:21:34,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:21:34,711 INFO L87 Difference]: Start difference. First operand 1195 states and 1345 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:21:35,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:35,784 INFO L93 Difference]: Finished difference Result 2420 states and 2718 transitions. [2025-03-08 16:21:35,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:21:35,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2025-03-08 16:21:35,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:35,787 INFO L225 Difference]: With dead ends: 2420 [2025-03-08 16:21:35,787 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 16:21:35,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:21:35,789 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 139 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:35,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 444 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:21:35,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 16:21:35,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 16:21:35,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 16:21:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 16:21:35,790 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 156 [2025-03-08 16:21:35,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:35,790 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 16:21:35,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:21:35,791 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 16:21:35,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 16:21:35,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:21:35,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 16:21:35,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:21:35,996 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:35,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.