./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-85.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 a45c2430f9ee77637d939805617689caafff3a773f20a4396b37c0a4bb861fb3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:02:38,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:02:38,169 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:02:38,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:02:38,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:02:38,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:02:38,195 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:02:38,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:02:38,196 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:02:38,196 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:02:38,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:02:38,197 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:02:38,197 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:02:38,197 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:02:38,197 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:02:38,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:02:38,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:02:38,198 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:02:38,198 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:02:38,198 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:02:38,198 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:02:38,198 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:02:38,198 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:02:38,198 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:02:38,198 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:02:38,199 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:02:38,199 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:02:38,199 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:02:38,199 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:02:38,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:02:38,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:02:38,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:02:38,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:02:38,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:02:38,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:02:38,200 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:02:38,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:02:38,200 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:02:38,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:02:38,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:02:38,200 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:02:38,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:02:38,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:02:38,200 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 -> a45c2430f9ee77637d939805617689caafff3a773f20a4396b37c0a4bb861fb3 [2025-03-17 06:02:38,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:02:38,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:02:38,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:02:38,426 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:02:38,426 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:02:38,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-85.i [2025-03-17 06:02:39,569 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0310a280/12ee56a417d04b8f933493030b215574/FLAG1477c4229 [2025-03-17 06:02:39,605 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException: Cannot invoke "String.equalsIgnoreCase(String)" because "kindStr" is null at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMRebuildTask.run(PDOMRebuildTask.java:94) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-03-17 06:02:39,862 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:02:39,863 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-85.i [2025-03-17 06:02:39,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0310a280/12ee56a417d04b8f933493030b215574/FLAG1477c4229 [2025-03-17 06:02:40,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0310a280/12ee56a417d04b8f933493030b215574 [2025-03-17 06:02:40,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:02:40,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:02:40,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:02:40,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:02:40,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:02:40,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:02:40" (1/1) ... [2025-03-17 06:02:40,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16c582f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:40, skipping insertion in model container [2025-03-17 06:02:40,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:02:40" (1/1) ... [2025-03-17 06:02:40,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:02:40,286 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-85.i[916,929] [2025-03-17 06:02:40,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:02:40,353 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:02:40,360 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-85.i[916,929] [2025-03-17 06:02:40,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:02:40,399 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:02:40,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:40 WrapperNode [2025-03-17 06:02:40,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:02:40,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:02:40,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:02:40,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:02:40,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:40" (1/1) ... [2025-03-17 06:02:40,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:40" (1/1) ... [2025-03-17 06:02:40,449 INFO L138 Inliner]: procedures = 27, calls = 174, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 510 [2025-03-17 06:02:40,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:02:40,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:02:40,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:02:40,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:02:40,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:40" (1/1) ... [2025-03-17 06:02:40,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:40" (1/1) ... [2025-03-17 06:02:40,464 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:40" (1/1) ... [2025-03-17 06:02:40,487 INFO L175 MemorySlicer]: Split 140 memory accesses to 2 slices as follows [2, 138]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 40 writes are split as follows [0, 40]. [2025-03-17 06:02:40,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:40" (1/1) ... [2025-03-17 06:02:40,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:40" (1/1) ... [2025-03-17 06:02:40,504 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:40" (1/1) ... [2025-03-17 06:02:40,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:40" (1/1) ... [2025-03-17 06:02:40,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:40" (1/1) ... [2025-03-17 06:02:40,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:40" (1/1) ... [2025-03-17 06:02:40,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:02:40,522 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:02:40,522 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:02:40,522 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:02:40,523 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:40" (1/1) ... [2025-03-17 06:02:40,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:02:40,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:02:40,547 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:02:40,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:02:40,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:02:40,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 06:02:40,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 06:02:40,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 06:02:40,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 06:02:40,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 06:02:40,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 06:02:40,569 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:02:40,569 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:02:40,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:02:40,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 06:02:40,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:02:40,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:02:40,655 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:02:40,656 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:02:41,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L131: havoc property_#t~mem80#1;havoc property_#t~ite93#1;havoc property_#t~mem86#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~ite92#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem101#1;havoc property_#t~mem94#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~short102#1;havoc property_#t~mem110#1;havoc property_#t~mem106#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~short105#1;havoc property_#t~short107#1;havoc property_#t~mem108#1;havoc property_#t~short109#1;havoc property_#t~short111#1;havoc property_#t~mem117#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~short116#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite127#1;havoc property_#t~mem123#1;havoc property_#t~mem120#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~short128#1;havoc property_#t~mem131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem132#1;havoc property_#t~ite141#1;havoc property_#t~mem133#1;havoc property_#t~ite138#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short142#1; [2025-03-17 06:02:41,083 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2025-03-17 06:02:41,084 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:02:41,094 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:02:41,095 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:02:41,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:02:41 BoogieIcfgContainer [2025-03-17 06:02:41,095 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:02:41,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:02:41,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:02:41,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:02:41,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:02:40" (1/3) ... [2025-03-17 06:02:41,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0496d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:02:41, skipping insertion in model container [2025-03-17 06:02:41,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:40" (2/3) ... [2025-03-17 06:02:41,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0496d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:02:41, skipping insertion in model container [2025-03-17 06:02:41,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:02:41" (3/3) ... [2025-03-17 06:02:41,104 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-85.i [2025-03-17 06:02:41,114 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:02:41,115 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-85.i that has 2 procedures, 125 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:02:41,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:02:41,172 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;@5fe39d41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:02:41,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:02:41,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 99 states have (on average 1.393939393939394) internal successors, (138), 100 states have internal predecessors, (138), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 06:02:41,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-17 06:02:41,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:41,187 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:41,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:41,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:41,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2050986333, now seen corresponding path program 1 times [2025-03-17 06:02:41,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:41,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675842600] [2025-03-17 06:02:41,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:41,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:41,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 06:02:41,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 06:02:41,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:41,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:41,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:02:41,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:41,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675842600] [2025-03-17 06:02:41,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675842600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:41,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:41,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:02:41,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168460560] [2025-03-17 06:02:41,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:41,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:02:41,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:41,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:02:41,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:41,751 INFO L87 Difference]: Start difference. First operand has 125 states, 99 states have (on average 1.393939393939394) internal successors, (138), 100 states have internal predecessors, (138), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:02:41,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:41,806 INFO L93 Difference]: Finished difference Result 250 states and 393 transitions. [2025-03-17 06:02:41,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:02:41,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2025-03-17 06:02:41,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:41,812 INFO L225 Difference]: With dead ends: 250 [2025-03-17 06:02:41,813 INFO L226 Difference]: Without dead ends: 126 [2025-03-17 06:02:41,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:41,817 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:41,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 522 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:02:41,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-17 06:02:41,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2025-03-17 06:02:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 100 states have (on average 1.36) internal successors, (136), 100 states have internal predecessors, (136), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 06:02:41,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 182 transitions. [2025-03-17 06:02:41,855 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 182 transitions. Word has length 175 [2025-03-17 06:02:41,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:41,856 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 182 transitions. [2025-03-17 06:02:41,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:02:41,856 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 182 transitions. [2025-03-17 06:02:41,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-17 06:02:41,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:41,859 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:41,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:02:41,859 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:41,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:41,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2062302460, now seen corresponding path program 1 times [2025-03-17 06:02:41,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:41,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33486765] [2025-03-17 06:02:41,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:41,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:41,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 06:02:42,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 06:02:42,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:42,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:44,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:02:44,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:44,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33486765] [2025-03-17 06:02:44,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33486765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:44,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:44,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:02:44,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223707667] [2025-03-17 06:02:44,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:44,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:02:44,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:44,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:02:44,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:02:44,244 INFO L87 Difference]: Start difference. First operand 125 states and 182 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:02:44,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:44,899 INFO L93 Difference]: Finished difference Result 462 states and 669 transitions. [2025-03-17 06:02:44,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:02:44,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2025-03-17 06:02:44,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:44,905 INFO L225 Difference]: With dead ends: 462 [2025-03-17 06:02:44,906 INFO L226 Difference]: Without dead ends: 338 [2025-03-17 06:02:44,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:02:44,908 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 489 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:44,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 422 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:02:44,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-17 06:02:44,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 194. [2025-03-17 06:02:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 166 states have (on average 1.3975903614457832) internal successors, (232), 167 states have internal predecessors, (232), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:02:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2025-03-17 06:02:44,932 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 175 [2025-03-17 06:02:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:44,933 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2025-03-17 06:02:44,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:02:44,933 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2025-03-17 06:02:44,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 06:02:44,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:44,936 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:44,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:02:44,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:44,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:44,937 INFO L85 PathProgramCache]: Analyzing trace with hash 612251571, now seen corresponding path program 1 times [2025-03-17 06:02:44,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:44,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434888559] [2025-03-17 06:02:44,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:44,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:44,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 06:02:44,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 06:02:45,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:45,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:02:46,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:46,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434888559] [2025-03-17 06:02:46,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434888559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:46,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:46,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:02:46,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657123575] [2025-03-17 06:02:46,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:46,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:02:46,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:46,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:02:46,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:02:46,336 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:02:46,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:46,997 INFO L93 Difference]: Finished difference Result 529 states and 765 transitions. [2025-03-17 06:02:46,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:02:46,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 176 [2025-03-17 06:02:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:47,002 INFO L225 Difference]: With dead ends: 529 [2025-03-17 06:02:47,003 INFO L226 Difference]: Without dead ends: 336 [2025-03-17 06:02:47,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:02:47,005 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 319 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:47,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 475 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:02:47,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-17 06:02:47,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 198. [2025-03-17 06:02:47,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 170 states have (on average 1.3941176470588235) internal successors, (237), 171 states have internal predecessors, (237), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:02:47,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 287 transitions. [2025-03-17 06:02:47,027 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 287 transitions. Word has length 176 [2025-03-17 06:02:47,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:47,028 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 287 transitions. [2025-03-17 06:02:47,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:02:47,028 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 287 transitions. [2025-03-17 06:02:47,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 06:02:47,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:47,029 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:47,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:02:47,030 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:47,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:47,030 INFO L85 PathProgramCache]: Analyzing trace with hash -199123153, now seen corresponding path program 1 times [2025-03-17 06:02:47,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:47,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399902875] [2025-03-17 06:02:47,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:47,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:47,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 06:02:47,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 06:02:47,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:47,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 06:02:47,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:47,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399902875] [2025-03-17 06:02:47,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399902875] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:02:47,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900090102] [2025-03-17 06:02:47,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:47,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:02:47,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:02:47,759 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:02:47,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:02:47,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 06:02:47,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 06:02:47,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:47,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:47,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 06:02:47,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:47,986 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 19 treesize of output 19 [2025-03-17 06:02:48,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:48,036 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 43 treesize of output 51 [2025-03-17 06:02:48,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:48,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 21 [2025-03-17 06:02:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:02:48,145 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:48,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900090102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:48,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:02:48,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2025-03-17 06:02:48,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218163034] [2025-03-17 06:02:48,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:48,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:02:48,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:48,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:02:48,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:02:48,147 INFO L87 Difference]: Start difference. First operand 198 states and 287 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:02:48,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:48,579 INFO L93 Difference]: Finished difference Result 612 states and 877 transitions. [2025-03-17 06:02:48,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:02:48,581 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2025-03-17 06:02:48,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:48,584 INFO L225 Difference]: With dead ends: 612 [2025-03-17 06:02:48,584 INFO L226 Difference]: Without dead ends: 415 [2025-03-17 06:02:48,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:02:48,586 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 217 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:48,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 913 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:02:48,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-17 06:02:48,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 211. [2025-03-17 06:02:48,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 183 states have (on average 1.3879781420765027) internal successors, (254), 184 states have internal predecessors, (254), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:02:48,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 304 transitions. [2025-03-17 06:02:48,608 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 304 transitions. Word has length 176 [2025-03-17 06:02:48,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:48,609 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 304 transitions. [2025-03-17 06:02:48,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:02:48,609 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 304 transitions. [2025-03-17 06:02:48,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 06:02:48,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:48,610 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:48,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 06:02:48,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:02:48,815 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:48,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:48,817 INFO L85 PathProgramCache]: Analyzing trace with hash -709657330, now seen corresponding path program 1 times [2025-03-17 06:02:48,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:48,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862444633] [2025-03-17 06:02:48,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:48,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:48,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 06:02:48,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 06:02:48,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:48,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:02:49,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:49,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862444633] [2025-03-17 06:02:49,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862444633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:49,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:49,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:02:49,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083677257] [2025-03-17 06:02:49,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:49,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:02:49,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:49,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:02:49,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:02:49,391 INFO L87 Difference]: Start difference. First operand 211 states and 304 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:02:50,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:50,141 INFO L93 Difference]: Finished difference Result 811 states and 1168 transitions. [2025-03-17 06:02:50,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:02:50,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2025-03-17 06:02:50,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:50,145 INFO L225 Difference]: With dead ends: 811 [2025-03-17 06:02:50,145 INFO L226 Difference]: Without dead ends: 601 [2025-03-17 06:02:50,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:02:50,148 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 295 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:50,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1178 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:02:50,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-17 06:02:50,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 268. [2025-03-17 06:02:50,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 240 states have (on average 1.4) internal successors, (336), 241 states have internal predecessors, (336), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:02:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 386 transitions. [2025-03-17 06:02:50,166 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 386 transitions. Word has length 176 [2025-03-17 06:02:50,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:50,167 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 386 transitions. [2025-03-17 06:02:50,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:02:50,167 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 386 transitions. [2025-03-17 06:02:50,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 06:02:50,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:50,169 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:50,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:02:50,169 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:50,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:50,169 INFO L85 PathProgramCache]: Analyzing trace with hash -607947378, now seen corresponding path program 1 times [2025-03-17 06:02:50,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:50,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725965456] [2025-03-17 06:02:50,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:50,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:50,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 06:02:50,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 06:02:50,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:50,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:50,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:02:50,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:50,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725965456] [2025-03-17 06:02:50,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725965456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:50,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:50,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:02:50,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994480170] [2025-03-17 06:02:50,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:50,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:02:50,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:50,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:02:50,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:02:50,728 INFO L87 Difference]: Start difference. First operand 268 states and 386 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:02:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:51,336 INFO L93 Difference]: Finished difference Result 874 states and 1257 transitions. [2025-03-17 06:02:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:02:51,337 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2025-03-17 06:02:51,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:51,340 INFO L225 Difference]: With dead ends: 874 [2025-03-17 06:02:51,340 INFO L226 Difference]: Without dead ends: 607 [2025-03-17 06:02:51,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:02:51,341 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 365 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:51,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 815 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:02:51,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-17 06:02:51,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 279. [2025-03-17 06:02:51,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 251 states have (on average 1.3904382470119523) internal successors, (349), 252 states have internal predecessors, (349), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:02:51,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 399 transitions. [2025-03-17 06:02:51,356 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 399 transitions. Word has length 176 [2025-03-17 06:02:51,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:51,356 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 399 transitions. [2025-03-17 06:02:51,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:02:51,356 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 399 transitions. [2025-03-17 06:02:51,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 06:02:51,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:51,358 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:51,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:02:51,358 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:51,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:51,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1118481555, now seen corresponding path program 1 times [2025-03-17 06:02:51,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:51,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465555214] [2025-03-17 06:02:51,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:51,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:51,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 06:02:51,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 06:02:51,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:51,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:51,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 06:02:51,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:51,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465555214] [2025-03-17 06:02:51,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465555214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:02:51,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440479991] [2025-03-17 06:02:51,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:51,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:02:51,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:02:51,857 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:02:51,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:02:51,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 06:02:51,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 06:02:51,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:51,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:51,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 06:02:52,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:52,030 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 9 [2025-03-17 06:02:52,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:02:52,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:52,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440479991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:52,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:02:52,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-17 06:02:52,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949449257] [2025-03-17 06:02:52,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:52,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:02:52,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:52,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:02:52,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:02:52,094 INFO L87 Difference]: Start difference. First operand 279 states and 399 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:02:52,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:52,476 INFO L93 Difference]: Finished difference Result 816 states and 1171 transitions. [2025-03-17 06:02:52,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:02:52,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2025-03-17 06:02:52,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:52,479 INFO L225 Difference]: With dead ends: 816 [2025-03-17 06:02:52,479 INFO L226 Difference]: Without dead ends: 538 [2025-03-17 06:02:52,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:02:52,480 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 160 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:52,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1462 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:02:52,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-17 06:02:52,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 290. [2025-03-17 06:02:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 262 states have (on average 1.3893129770992367) internal successors, (364), 263 states have internal predecessors, (364), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:02:52,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 414 transitions. [2025-03-17 06:02:52,493 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 414 transitions. Word has length 176 [2025-03-17 06:02:52,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:52,494 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 414 transitions. [2025-03-17 06:02:52,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:02:52,494 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 414 transitions. [2025-03-17 06:02:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 06:02:52,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:52,495 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:52,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 06:02:52,696 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,SelfDestructingSolverStorable6 [2025-03-17 06:02:52,696 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:52,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:52,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1342760436, now seen corresponding path program 1 times [2025-03-17 06:02:52,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:52,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786394435] [2025-03-17 06:02:52,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:52,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:52,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 06:02:52,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 06:02:52,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:52,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:53,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:02:53,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:53,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786394435] [2025-03-17 06:02:53,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786394435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:53,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:53,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:02:53,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783726230] [2025-03-17 06:02:53,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:53,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:02:53,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:53,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:02:53,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:02:53,199 INFO L87 Difference]: Start difference. First operand 290 states and 414 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:02:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:53,875 INFO L93 Difference]: Finished difference Result 949 states and 1359 transitions. [2025-03-17 06:02:53,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:02:53,876 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2025-03-17 06:02:53,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:53,879 INFO L225 Difference]: With dead ends: 949 [2025-03-17 06:02:53,879 INFO L226 Difference]: Without dead ends: 660 [2025-03-17 06:02:53,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:02:53,880 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 305 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:53,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1187 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:02:53,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-03-17 06:02:53,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 300. [2025-03-17 06:02:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 272 states have (on average 1.3970588235294117) internal successors, (380), 273 states have internal predecessors, (380), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:02:53,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 430 transitions. [2025-03-17 06:02:53,899 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 430 transitions. Word has length 176 [2025-03-17 06:02:53,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:53,900 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 430 transitions. [2025-03-17 06:02:53,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:02:53,900 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 430 transitions. [2025-03-17 06:02:53,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 06:02:53,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:53,902 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:53,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:02:53,902 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:53,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:53,903 INFO L85 PathProgramCache]: Analyzing trace with hash 832226259, now seen corresponding path program 1 times [2025-03-17 06:02:53,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:53,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956926780] [2025-03-17 06:02:53,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:53,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:53,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 06:02:53,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 06:02:53,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:53,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:54,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:02:54,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:54,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956926780] [2025-03-17 06:02:54,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956926780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:54,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:54,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:02:54,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254628454] [2025-03-17 06:02:54,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:54,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:02:54,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:54,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:02:54,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:02:54,199 INFO L87 Difference]: Start difference. First operand 300 states and 430 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:02:54,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:54,449 INFO L93 Difference]: Finished difference Result 853 states and 1224 transitions. [2025-03-17 06:02:54,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:02:54,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2025-03-17 06:02:54,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:54,452 INFO L225 Difference]: With dead ends: 853 [2025-03-17 06:02:54,452 INFO L226 Difference]: Without dead ends: 554 [2025-03-17 06:02:54,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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-17 06:02:54,453 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 148 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:54,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 672 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:02:54,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-17 06:02:54,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 372. [2025-03-17 06:02:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 344 states have (on average 1.4156976744186047) internal successors, (487), 345 states have internal predecessors, (487), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:02:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 537 transitions. [2025-03-17 06:02:54,466 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 537 transitions. Word has length 176 [2025-03-17 06:02:54,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:54,466 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 537 transitions. [2025-03-17 06:02:54,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:02:54,467 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 537 transitions. [2025-03-17 06:02:54,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 06:02:54,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:54,469 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:54,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:02:54,469 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:54,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:54,469 INFO L85 PathProgramCache]: Analyzing trace with hash 531385712, now seen corresponding path program 1 times [2025-03-17 06:02:54,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:54,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299196779] [2025-03-17 06:02:54,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:54,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:54,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 06:02:54,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 06:02:54,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:54,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:02:55,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:55,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299196779] [2025-03-17 06:02:55,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299196779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:55,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:55,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:02:55,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491183978] [2025-03-17 06:02:55,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:55,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:02:55,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:55,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:02:55,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:02:55,172 INFO L87 Difference]: Start difference. First operand 372 states and 537 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:02:55,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:55,574 INFO L93 Difference]: Finished difference Result 980 states and 1418 transitions. [2025-03-17 06:02:55,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:02:55,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 176 [2025-03-17 06:02:55,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:55,576 INFO L225 Difference]: With dead ends: 980 [2025-03-17 06:02:55,577 INFO L226 Difference]: Without dead ends: 609 [2025-03-17 06:02:55,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:02:55,578 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 147 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:55,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 764 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:02:55,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-03-17 06:02:55,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 378. [2025-03-17 06:02:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 350 states have (on average 1.3942857142857144) internal successors, (488), 351 states have internal predecessors, (488), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:02:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 538 transitions. [2025-03-17 06:02:55,598 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 538 transitions. Word has length 176 [2025-03-17 06:02:55,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:55,598 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 538 transitions. [2025-03-17 06:02:55,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:02:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 538 transitions. [2025-03-17 06:02:55,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 06:02:55,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:55,601 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:55,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:02:55,601 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:55,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:55,601 INFO L85 PathProgramCache]: Analyzing trace with hash 498288565, now seen corresponding path program 1 times [2025-03-17 06:02:55,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:55,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986742548] [2025-03-17 06:02:55,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:55,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:55,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 06:02:55,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 06:02:55,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:55,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:55,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:02:55,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:55,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986742548] [2025-03-17 06:02:55,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986742548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:55,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:55,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:02:55,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147171014] [2025-03-17 06:02:55,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:55,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:02:55,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:55,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:02:55,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:02:55,822 INFO L87 Difference]: Start difference. First operand 378 states and 538 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:02:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:56,064 INFO L93 Difference]: Finished difference Result 936 states and 1327 transitions. [2025-03-17 06:02:56,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:02:56,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2025-03-17 06:02:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:56,067 INFO L225 Difference]: With dead ends: 936 [2025-03-17 06:02:56,067 INFO L226 Difference]: Without dead ends: 559 [2025-03-17 06:02:56,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-17 06:02:56,068 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 150 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:56,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 814 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:02:56,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-17 06:02:56,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 378. [2025-03-17 06:02:56,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 350 states have (on average 1.3828571428571428) internal successors, (484), 351 states have internal predecessors, (484), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:02:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 534 transitions. [2025-03-17 06:02:56,080 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 534 transitions. Word has length 176 [2025-03-17 06:02:56,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:56,081 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 534 transitions. [2025-03-17 06:02:56,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:02:56,081 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 534 transitions. [2025-03-17 06:02:56,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-17 06:02:56,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:56,083 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:56,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:02:56,083 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:56,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:56,083 INFO L85 PathProgramCache]: Analyzing trace with hash 293751166, now seen corresponding path program 1 times [2025-03-17 06:02:56,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:56,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650966905] [2025-03-17 06:02:56,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:56,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:56,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 06:02:56,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 06:02:56,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:56,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:02:56,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:56,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650966905] [2025-03-17 06:02:56,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650966905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:56,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:56,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:02:56,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305191863] [2025-03-17 06:02:56,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:56,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:02:56,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:56,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:02:56,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:02:56,435 INFO L87 Difference]: Start difference. First operand 378 states and 534 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:02:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:56,833 INFO L93 Difference]: Finished difference Result 930 states and 1311 transitions. [2025-03-17 06:02:56,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:02:56,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 177 [2025-03-17 06:02:56,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:56,836 INFO L225 Difference]: With dead ends: 930 [2025-03-17 06:02:56,836 INFO L226 Difference]: Without dead ends: 553 [2025-03-17 06:02:56,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:02:56,839 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 291 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:56,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 502 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:02:56,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-17 06:02:56,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 372. [2025-03-17 06:02:56,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 344 states have (on average 1.3837209302325582) internal successors, (476), 345 states have internal predecessors, (476), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:02:56,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 526 transitions. [2025-03-17 06:02:56,852 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 526 transitions. Word has length 177 [2025-03-17 06:02:56,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:56,853 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 526 transitions. [2025-03-17 06:02:56,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:02:56,853 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 526 transitions. [2025-03-17 06:02:56,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-17 06:02:56,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:56,855 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:56,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 06:02:56,855 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:56,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:56,856 INFO L85 PathProgramCache]: Analyzing trace with hash -40186528, now seen corresponding path program 1 times [2025-03-17 06:02:56,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:56,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512553088] [2025-03-17 06:02:56,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:56,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:56,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 06:02:56,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 06:02:56,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:56,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:57,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:02:57,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:57,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512553088] [2025-03-17 06:02:57,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512553088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:57,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:57,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:02:57,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994057883] [2025-03-17 06:02:57,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:57,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:02:57,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:57,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:02:57,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:02:57,275 INFO L87 Difference]: Start difference. First operand 372 states and 526 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:02:57,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:57,648 INFO L93 Difference]: Finished difference Result 908 states and 1285 transitions. [2025-03-17 06:02:57,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:02:57,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 177 [2025-03-17 06:02:57,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:57,651 INFO L225 Difference]: With dead ends: 908 [2025-03-17 06:02:57,651 INFO L226 Difference]: Without dead ends: 537 [2025-03-17 06:02:57,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:02:57,653 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 288 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:57,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 337 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:02:57,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-17 06:02:57,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 374. [2025-03-17 06:02:57,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 346 states have (on average 1.3815028901734103) internal successors, (478), 347 states have internal predecessors, (478), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:02:57,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 528 transitions. [2025-03-17 06:02:57,667 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 528 transitions. Word has length 177 [2025-03-17 06:02:57,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:57,667 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 528 transitions. [2025-03-17 06:02:57,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:02:57,667 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 528 transitions. [2025-03-17 06:02:57,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-17 06:02:57,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:57,669 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:57,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 06:02:57,669 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:57,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:57,669 INFO L85 PathProgramCache]: Analyzing trace with hash -550720705, now seen corresponding path program 1 times [2025-03-17 06:02:57,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:57,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699475230] [2025-03-17 06:02:57,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:57,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:57,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 06:02:57,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 06:02:57,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:57,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:02:58,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:58,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699475230] [2025-03-17 06:02:58,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699475230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:58,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:58,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:02:58,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827468633] [2025-03-17 06:02:58,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:58,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:02:58,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:58,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:02:58,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:02:58,129 INFO L87 Difference]: Start difference. First operand 374 states and 528 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:02:58,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:58,856 INFO L93 Difference]: Finished difference Result 1124 states and 1590 transitions. [2025-03-17 06:02:58,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:02:58,856 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 177 [2025-03-17 06:02:58,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:58,859 INFO L225 Difference]: With dead ends: 1124 [2025-03-17 06:02:58,859 INFO L226 Difference]: Without dead ends: 751 [2025-03-17 06:02:58,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:02:58,861 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 295 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:58,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1582 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:02:58,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-03-17 06:02:58,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 380. [2025-03-17 06:02:58,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 352 states have (on average 1.375) internal successors, (484), 353 states have internal predecessors, (484), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:02:58,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 534 transitions. [2025-03-17 06:02:58,884 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 534 transitions. Word has length 177 [2025-03-17 06:02:58,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:58,884 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 534 transitions. [2025-03-17 06:02:58,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:02:58,885 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 534 transitions. [2025-03-17 06:02:58,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-17 06:02:58,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:58,887 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:58,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 06:02:58,887 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:58,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:58,888 INFO L85 PathProgramCache]: Analyzing trace with hash -218714693, now seen corresponding path program 1 times [2025-03-17 06:02:58,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:58,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874581803] [2025-03-17 06:02:58,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:58,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:58,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 06:02:58,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 06:02:58,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:58,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:59,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:02:59,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:59,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874581803] [2025-03-17 06:02:59,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874581803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:59,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:59,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:02:59,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834921578] [2025-03-17 06:02:59,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:59,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:02:59,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:59,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:02:59,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:02:59,590 INFO L87 Difference]: Start difference. First operand 380 states and 534 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:02:59,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:59,944 INFO L93 Difference]: Finished difference Result 982 states and 1391 transitions. [2025-03-17 06:02:59,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:02:59,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 177 [2025-03-17 06:02:59,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:59,947 INFO L225 Difference]: With dead ends: 982 [2025-03-17 06:02:59,947 INFO L226 Difference]: Without dead ends: 603 [2025-03-17 06:02:59,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:02:59,948 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 251 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:59,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 366 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:02:59,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-03-17 06:02:59,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 336. [2025-03-17 06:02:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 308 states have (on average 1.344155844155844) internal successors, (414), 309 states have internal predecessors, (414), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:02:59,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 464 transitions. [2025-03-17 06:02:59,968 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 464 transitions. Word has length 177 [2025-03-17 06:02:59,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:59,968 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 464 transitions. [2025-03-17 06:02:59,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:02:59,968 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 464 transitions. [2025-03-17 06:02:59,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-17 06:02:59,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:59,969 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:59,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 06:02:59,969 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:59,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:59,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1030089417, now seen corresponding path program 1 times [2025-03-17 06:02:59,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:59,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800715978] [2025-03-17 06:02:59,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:59,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:59,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 06:03:00,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 06:03:00,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:00,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:00,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 06:03:00,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:00,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800715978] [2025-03-17 06:03:00,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800715978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:03:00,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806321361] [2025-03-17 06:03:00,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:00,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:03:00,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:03:00,475 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:03:00,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:03:00,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 06:03:00,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 06:03:00,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:00,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:00,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 06:03:00,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:03:00,630 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-17 06:03:00,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:00,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2025-03-17 06:03:00,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:00,685 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 50 treesize of output 18 [2025-03-17 06:03:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:00,727 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:03:00,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806321361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:00,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:03:00,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2025-03-17 06:03:00,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055729025] [2025-03-17 06:03:00,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:00,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:03:00,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:00,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:03:00,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:03:00,728 INFO L87 Difference]: Start difference. First operand 336 states and 464 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:01,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:01,187 INFO L93 Difference]: Finished difference Result 823 states and 1142 transitions. [2025-03-17 06:03:01,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:03:01,187 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 177 [2025-03-17 06:03:01,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:01,190 INFO L225 Difference]: With dead ends: 823 [2025-03-17 06:03:01,190 INFO L226 Difference]: Without dead ends: 488 [2025-03-17 06:03:01,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:03:01,191 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 133 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:01,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1069 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:03:01,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-17 06:03:01,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 322. [2025-03-17 06:03:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 294 states have (on average 1.3435374149659864) internal successors, (395), 295 states have internal predecessors, (395), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:03:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 445 transitions. [2025-03-17 06:03:01,208 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 445 transitions. Word has length 177 [2025-03-17 06:03:01,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:01,208 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 445 transitions. [2025-03-17 06:03:01,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:01,208 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 445 transitions. [2025-03-17 06:03:01,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-17 06:03:01,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:01,209 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:01,219 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-17 06:03:01,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:03:01,410 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:01,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:01,410 INFO L85 PathProgramCache]: Analyzing trace with hash -883111924, now seen corresponding path program 1 times [2025-03-17 06:03:01,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:01,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257107611] [2025-03-17 06:03:01,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:01,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:01,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 06:03:01,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 06:03:01,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:01,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:01,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:01,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:01,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257107611] [2025-03-17 06:03:01,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257107611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:01,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:01,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:03:01,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151824003] [2025-03-17 06:03:01,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:01,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:03:01,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:01,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:03:01,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:03:01,471 INFO L87 Difference]: Start difference. First operand 322 states and 445 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:01,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:01,488 INFO L93 Difference]: Finished difference Result 644 states and 891 transitions. [2025-03-17 06:03:01,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:03:01,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178 [2025-03-17 06:03:01,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:01,490 INFO L225 Difference]: With dead ends: 644 [2025-03-17 06:03:01,490 INFO L226 Difference]: Without dead ends: 323 [2025-03-17 06:03:01,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:03:01,491 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:01,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:03:01,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-17 06:03:01,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2025-03-17 06:03:01,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 295 states have (on average 1.3423728813559321) internal successors, (396), 296 states have internal predecessors, (396), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:03:01,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 446 transitions. [2025-03-17 06:03:01,505 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 446 transitions. Word has length 178 [2025-03-17 06:03:01,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:01,506 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 446 transitions. [2025-03-17 06:03:01,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:01,506 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 446 transitions. [2025-03-17 06:03:01,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-17 06:03:01,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:01,507 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:01,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 06:03:01,507 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:01,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:01,507 INFO L85 PathProgramCache]: Analyzing trace with hash 749692075, now seen corresponding path program 1 times [2025-03-17 06:03:01,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:01,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497308265] [2025-03-17 06:03:01,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:01,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:01,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 06:03:01,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 06:03:01,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:01,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:01,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:01,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497308265] [2025-03-17 06:03:01,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497308265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:01,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:01,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:03:01,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647157537] [2025-03-17 06:03:01,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:01,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:03:01,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:01,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:03:01,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:03:01,610 INFO L87 Difference]: Start difference. First operand 323 states and 446 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:01,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:01,825 INFO L93 Difference]: Finished difference Result 812 states and 1120 transitions. [2025-03-17 06:03:01,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:03:01,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178 [2025-03-17 06:03:01,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:01,827 INFO L225 Difference]: With dead ends: 812 [2025-03-17 06:03:01,827 INFO L226 Difference]: Without dead ends: 490 [2025-03-17 06:03:01,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:03:01,828 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 92 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:01,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 573 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:03:01,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-17 06:03:01,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 323. [2025-03-17 06:03:01,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 295 states have (on average 1.3389830508474576) internal successors, (395), 296 states have internal predecessors, (395), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:03:01,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 445 transitions. [2025-03-17 06:03:01,843 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 445 transitions. Word has length 178 [2025-03-17 06:03:01,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:01,843 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 445 transitions. [2025-03-17 06:03:01,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:01,844 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 445 transitions. [2025-03-17 06:03:01,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-17 06:03:01,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:01,845 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:01,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 06:03:01,845 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:01,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:01,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1594974966, now seen corresponding path program 1 times [2025-03-17 06:03:01,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:01,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347302135] [2025-03-17 06:03:01,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:01,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:01,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 06:03:01,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 06:03:01,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:01,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:01,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:01,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347302135] [2025-03-17 06:03:01,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347302135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:01,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:01,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:03:01,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077080454] [2025-03-17 06:03:01,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:01,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:03:01,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:01,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:03:01,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:03:01,948 INFO L87 Difference]: Start difference. First operand 323 states and 445 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:02,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:02,036 INFO L93 Difference]: Finished difference Result 550 states and 759 transitions. [2025-03-17 06:03:02,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:03:02,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178 [2025-03-17 06:03:02,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:02,038 INFO L225 Difference]: With dead ends: 550 [2025-03-17 06:03:02,038 INFO L226 Difference]: Without dead ends: 228 [2025-03-17 06:03:02,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:03:02,039 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:02,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 438 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:03:02,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-17 06:03:02,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2025-03-17 06:03:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 199 states have (on average 1.321608040201005) internal successors, (263), 200 states have internal predecessors, (263), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:03:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2025-03-17 06:03:02,051 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 178 [2025-03-17 06:03:02,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:02,051 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2025-03-17 06:03:02,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:02,052 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2025-03-17 06:03:02,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-17 06:03:02,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:02,052 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:02,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 06:03:02,053 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:02,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:02,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1034403404, now seen corresponding path program 1 times [2025-03-17 06:03:02,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:02,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963724711] [2025-03-17 06:03:02,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:02,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:02,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-17 06:03:02,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-17 06:03:02,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:02,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:02,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:02,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963724711] [2025-03-17 06:03:02,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963724711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:02,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:02,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:03:02,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191097405] [2025-03-17 06:03:02,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:02,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:03:02,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:02,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:03:02,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:03:02,488 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:02,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:02,869 INFO L93 Difference]: Finished difference Result 513 states and 710 transitions. [2025-03-17 06:03:02,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:03:02,869 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 179 [2025-03-17 06:03:02,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:02,871 INFO L225 Difference]: With dead ends: 513 [2025-03-17 06:03:02,871 INFO L226 Difference]: Without dead ends: 287 [2025-03-17 06:03:02,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:03:02,872 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 146 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:02,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1167 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:03:02,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-17 06:03:02,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 233. [2025-03-17 06:03:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 205 states have (on average 1.3121951219512196) internal successors, (269), 206 states have internal predecessors, (269), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:03:02,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 319 transitions. [2025-03-17 06:03:02,888 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 319 transitions. Word has length 179 [2025-03-17 06:03:02,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:02,889 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 319 transitions. [2025-03-17 06:03:02,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 319 transitions. [2025-03-17 06:03:02,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-17 06:03:02,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:02,890 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:02,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 06:03:02,890 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:02,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:02,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1220945642, now seen corresponding path program 1 times [2025-03-17 06:03:02,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:02,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466066659] [2025-03-17 06:03:02,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:02,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:02,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 06:03:02,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 06:03:02,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:02,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:02,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:02,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466066659] [2025-03-17 06:03:02,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466066659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:02,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:02,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:03:02,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827382192] [2025-03-17 06:03:02,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:02,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:03:02,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:02,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:03:02,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:03:02,950 INFO L87 Difference]: Start difference. First operand 233 states and 319 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:02,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:02,969 INFO L93 Difference]: Finished difference Result 467 states and 641 transitions. [2025-03-17 06:03:02,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:03:02,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 181 [2025-03-17 06:03:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:02,971 INFO L225 Difference]: With dead ends: 467 [2025-03-17 06:03:02,971 INFO L226 Difference]: Without dead ends: 235 [2025-03-17 06:03:02,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:03:02,972 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:02,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 342 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:03:02,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-17 06:03:02,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2025-03-17 06:03:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 207 states have (on average 1.3091787439613527) internal successors, (271), 208 states have internal predecessors, (271), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:03:02,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 321 transitions. [2025-03-17 06:03:02,990 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 321 transitions. Word has length 181 [2025-03-17 06:03:02,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:02,990 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 321 transitions. [2025-03-17 06:03:02,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:02,991 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 321 transitions. [2025-03-17 06:03:02,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-17 06:03:02,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:02,992 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:02,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 06:03:02,992 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:02,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:02,992 INFO L85 PathProgramCache]: Analyzing trace with hash 132364055, now seen corresponding path program 1 times [2025-03-17 06:03:02,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:02,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209545316] [2025-03-17 06:03:02,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:02,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:03,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 06:03:03,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 06:03:03,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:03,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:03,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:03,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:03,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209545316] [2025-03-17 06:03:03,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209545316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:03,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:03,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:03:03,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103162904] [2025-03-17 06:03:03,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:03,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:03:03,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:03,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:03:03,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:03:03,132 INFO L87 Difference]: Start difference. First operand 235 states and 321 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:03,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:03,302 INFO L93 Difference]: Finished difference Result 535 states and 732 transitions. [2025-03-17 06:03:03,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:03:03,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 181 [2025-03-17 06:03:03,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:03,304 INFO L225 Difference]: With dead ends: 535 [2025-03-17 06:03:03,304 INFO L226 Difference]: Without dead ends: 301 [2025-03-17 06:03:03,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:03:03,306 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 50 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:03,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 530 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:03:03,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-17 06:03:03,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 235. [2025-03-17 06:03:03,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 208 states have internal predecessors, (269), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:03:03,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 319 transitions. [2025-03-17 06:03:03,321 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 319 transitions. Word has length 181 [2025-03-17 06:03:03,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:03,322 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 319 transitions. [2025-03-17 06:03:03,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:03,322 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 319 transitions. [2025-03-17 06:03:03,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-17 06:03:03,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:03,324 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:03,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 06:03:03,324 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:03,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:03,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1639915864, now seen corresponding path program 1 times [2025-03-17 06:03:03,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:03,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545659878] [2025-03-17 06:03:03,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:03,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:03,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 06:03:03,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 06:03:03,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:03,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:03,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:03,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:03,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545659878] [2025-03-17 06:03:03,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545659878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:03,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:03,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:03:03,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659786272] [2025-03-17 06:03:03,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:03,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:03:03,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:03,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:03:03,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:03:03,446 INFO L87 Difference]: Start difference. First operand 235 states and 319 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:03,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:03,541 INFO L93 Difference]: Finished difference Result 459 states and 625 transitions. [2025-03-17 06:03:03,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:03:03,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 181 [2025-03-17 06:03:03,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:03,542 INFO L225 Difference]: With dead ends: 459 [2025-03-17 06:03:03,543 INFO L226 Difference]: Without dead ends: 225 [2025-03-17 06:03:03,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:03:03,543 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:03,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 423 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:03:03,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-17 06:03:03,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2025-03-17 06:03:03,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 195 states have (on average 1.2974358974358975) internal successors, (253), 196 states have internal predecessors, (253), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:03:03,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 303 transitions. [2025-03-17 06:03:03,558 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 303 transitions. Word has length 181 [2025-03-17 06:03:03,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:03,558 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 303 transitions. [2025-03-17 06:03:03,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:03,558 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 303 transitions. [2025-03-17 06:03:03,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-17 06:03:03,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:03,559 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:03,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 06:03:03,560 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:03,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:03,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1868121843, now seen corresponding path program 1 times [2025-03-17 06:03:03,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:03,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131470575] [2025-03-17 06:03:03,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:03,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:03,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-17 06:03:03,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-17 06:03:03,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:03,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:03,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:03,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131470575] [2025-03-17 06:03:03,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131470575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:03,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:03,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:03:03,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732553784] [2025-03-17 06:03:03,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:03,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:03:03,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:03,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:03:03,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:03:03,626 INFO L87 Difference]: Start difference. First operand 223 states and 303 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:03,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:03,651 INFO L93 Difference]: Finished difference Result 451 states and 613 transitions. [2025-03-17 06:03:03,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:03:03,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 183 [2025-03-17 06:03:03,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:03,653 INFO L225 Difference]: With dead ends: 451 [2025-03-17 06:03:03,653 INFO L226 Difference]: Without dead ends: 229 [2025-03-17 06:03:03,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:03:03,654 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:03,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 490 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:03:03,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-17 06:03:03,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2025-03-17 06:03:03,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 199 states have (on average 1.2914572864321607) internal successors, (257), 200 states have internal predecessors, (257), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:03:03,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 307 transitions. [2025-03-17 06:03:03,667 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 307 transitions. Word has length 183 [2025-03-17 06:03:03,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:03,667 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 307 transitions. [2025-03-17 06:03:03,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:03,667 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 307 transitions. [2025-03-17 06:03:03,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-17 06:03:03,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:03,669 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:03,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 06:03:03,669 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:03,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:03,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1739039124, now seen corresponding path program 1 times [2025-03-17 06:03:03,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:03,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844050643] [2025-03-17 06:03:03,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:03,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:03,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-17 06:03:03,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-17 06:03:03,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:03,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:04,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:04,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:04,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844050643] [2025-03-17 06:03:04,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844050643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:04,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:04,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:03:04,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347789383] [2025-03-17 06:03:04,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:04,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:03:04,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:04,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:03:04,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:03:04,138 INFO L87 Difference]: Start difference. First operand 227 states and 307 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:04,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:04,472 INFO L93 Difference]: Finished difference Result 635 states and 853 transitions. [2025-03-17 06:03:04,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:03:04,473 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 183 [2025-03-17 06:03:04,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:04,475 INFO L225 Difference]: With dead ends: 635 [2025-03-17 06:03:04,475 INFO L226 Difference]: Without dead ends: 409 [2025-03-17 06:03:04,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:03:04,475 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 144 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:04,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1110 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:03:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-03-17 06:03:04,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 289. [2025-03-17 06:03:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 261 states have (on average 1.260536398467433) internal successors, (329), 262 states have internal predecessors, (329), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 06:03:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 379 transitions. [2025-03-17 06:03:04,490 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 379 transitions. Word has length 183 [2025-03-17 06:03:04,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:04,490 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 379 transitions. [2025-03-17 06:03:04,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 379 transitions. [2025-03-17 06:03:04,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-17 06:03:04,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:04,492 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:04,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 06:03:04,492 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:04,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:04,492 INFO L85 PathProgramCache]: Analyzing trace with hash -82856964, now seen corresponding path program 1 times [2025-03-17 06:03:04,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:04,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169354185] [2025-03-17 06:03:04,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:04,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:04,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-17 06:03:04,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 06:03:04,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:04,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:05,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:05,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169354185] [2025-03-17 06:03:05,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169354185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:05,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:05,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:03:05,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220118677] [2025-03-17 06:03:05,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:05,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:03:05,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:05,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:03:05,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:03:05,387 INFO L87 Difference]: Start difference. First operand 289 states and 379 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:05,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:05,627 INFO L93 Difference]: Finished difference Result 641 states and 836 transitions. [2025-03-17 06:03:05,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:03:05,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 184 [2025-03-17 06:03:05,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:05,629 INFO L225 Difference]: With dead ends: 641 [2025-03-17 06:03:05,629 INFO L226 Difference]: Without dead ends: 353 [2025-03-17 06:03:05,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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-17 06:03:05,630 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 131 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:05,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 607 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:03:05,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-17 06:03:05,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 217. [2025-03-17 06:03:05,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 191 states have (on average 1.2460732984293195) internal successors, (238), 191 states have internal predecessors, (238), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 06:03:05,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 284 transitions. [2025-03-17 06:03:05,642 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 284 transitions. Word has length 184 [2025-03-17 06:03:05,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:05,642 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 284 transitions. [2025-03-17 06:03:05,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:05,643 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 284 transitions. [2025-03-17 06:03:05,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-17 06:03:05,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:05,643 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:05,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 06:03:05,645 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:05,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:05,645 INFO L85 PathProgramCache]: Analyzing trace with hash -565625585, now seen corresponding path program 1 times [2025-03-17 06:03:05,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:05,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565232856] [2025-03-17 06:03:05,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:05,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:05,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-17 06:03:05,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 06:03:05,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:05,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:06,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:06,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565232856] [2025-03-17 06:03:06,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565232856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:06,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:06,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:03:06,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424476338] [2025-03-17 06:03:06,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:06,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:03:06,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:06,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:03:06,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:03:06,519 INFO L87 Difference]: Start difference. First operand 217 states and 284 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:06,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:06,785 INFO L93 Difference]: Finished difference Result 467 states and 610 transitions. [2025-03-17 06:03:06,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:03:06,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 185 [2025-03-17 06:03:06,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:06,787 INFO L225 Difference]: With dead ends: 467 [2025-03-17 06:03:06,787 INFO L226 Difference]: Without dead ends: 251 [2025-03-17 06:03:06,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 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-17 06:03:06,788 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 59 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:06,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 599 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:03:06,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-17 06:03:06,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 217. [2025-03-17 06:03:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 191 states have (on average 1.2408376963350785) internal successors, (237), 191 states have internal predecessors, (237), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 06:03:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 283 transitions. [2025-03-17 06:03:06,800 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 283 transitions. Word has length 185 [2025-03-17 06:03:06,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:06,801 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 283 transitions. [2025-03-17 06:03:06,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:06,801 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 283 transitions. [2025-03-17 06:03:06,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 06:03:06,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:06,802 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:06,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 06:03:06,802 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:06,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:06,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1887530655, now seen corresponding path program 1 times [2025-03-17 06:03:06,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:06,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933092006] [2025-03-17 06:03:06,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:06,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:06,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 06:03:06,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 06:03:06,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:06,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:08,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:08,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:08,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933092006] [2025-03-17 06:03:08,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933092006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:08,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:08,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:03:08,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287216198] [2025-03-17 06:03:08,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:08,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:03:08,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:08,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:03:08,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:03:08,230 INFO L87 Difference]: Start difference. First operand 217 states and 283 transitions. Second operand has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 12 states have internal predecessors, (74), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:08,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:08,934 INFO L93 Difference]: Finished difference Result 546 states and 711 transitions. [2025-03-17 06:03:08,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 06:03:08,934 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 12 states have internal predecessors, (74), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 186 [2025-03-17 06:03:08,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:08,936 INFO L225 Difference]: With dead ends: 546 [2025-03-17 06:03:08,936 INFO L226 Difference]: Without dead ends: 330 [2025-03-17 06:03:08,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:03:08,937 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 158 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:08,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1488 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:03:08,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-17 06:03:08,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 280. [2025-03-17 06:03:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 244 states have (on average 1.2418032786885247) internal successors, (303), 245 states have internal predecessors, (303), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 06:03:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 365 transitions. [2025-03-17 06:03:08,956 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 365 transitions. Word has length 186 [2025-03-17 06:03:08,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:08,956 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 365 transitions. [2025-03-17 06:03:08,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 12 states have internal predecessors, (74), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:08,957 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 365 transitions. [2025-03-17 06:03:08,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 06:03:08,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:08,958 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:08,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 06:03:08,958 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:08,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:08,959 INFO L85 PathProgramCache]: Analyzing trace with hash -444415233, now seen corresponding path program 1 times [2025-03-17 06:03:08,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:08,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611446807] [2025-03-17 06:03:08,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:08,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:08,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 06:03:09,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 06:03:09,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:09,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:10,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:10,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:10,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611446807] [2025-03-17 06:03:10,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611446807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:10,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:10,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 06:03:10,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795895396] [2025-03-17 06:03:10,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:10,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 06:03:10,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:10,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 06:03:10,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:03:10,074 INFO L87 Difference]: Start difference. First operand 280 states and 365 transitions. Second operand has 13 states, 12 states have (on average 6.166666666666667) internal successors, (74), 13 states have internal predecessors, (74), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:10,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:10,526 INFO L93 Difference]: Finished difference Result 628 states and 816 transitions. [2025-03-17 06:03:10,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 06:03:10,526 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.166666666666667) internal successors, (74), 13 states have internal predecessors, (74), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 186 [2025-03-17 06:03:10,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:10,528 INFO L225 Difference]: With dead ends: 628 [2025-03-17 06:03:10,528 INFO L226 Difference]: Without dead ends: 349 [2025-03-17 06:03:10,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:03:10,529 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 195 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:10,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 891 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:03:10,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-17 06:03:10,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 246. [2025-03-17 06:03:10,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 219 states have (on average 1.2374429223744292) internal successors, (271), 219 states have internal predecessors, (271), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 06:03:10,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 317 transitions. [2025-03-17 06:03:10,542 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 317 transitions. Word has length 186 [2025-03-17 06:03:10,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:10,542 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 317 transitions. [2025-03-17 06:03:10,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.166666666666667) internal successors, (74), 13 states have internal predecessors, (74), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:10,542 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 317 transitions. [2025-03-17 06:03:10,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 06:03:10,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:10,543 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:10,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 06:03:10,543 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:10,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:10,544 INFO L85 PathProgramCache]: Analyzing trace with hash -315332514, now seen corresponding path program 1 times [2025-03-17 06:03:10,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:10,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167556304] [2025-03-17 06:03:10,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:10,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:10,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 06:03:10,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 06:03:10,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:10,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:11,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:11,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167556304] [2025-03-17 06:03:11,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167556304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:11,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:11,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:03:11,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462801798] [2025-03-17 06:03:11,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:11,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:03:11,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:11,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:03:11,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:03:11,326 INFO L87 Difference]: Start difference. First operand 246 states and 317 transitions. Second operand has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 10 states have internal predecessors, (74), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:11,650 INFO L93 Difference]: Finished difference Result 549 states and 707 transitions. [2025-03-17 06:03:11,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:03:11,651 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 10 states have internal predecessors, (74), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 186 [2025-03-17 06:03:11,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:11,652 INFO L225 Difference]: With dead ends: 549 [2025-03-17 06:03:11,652 INFO L226 Difference]: Without dead ends: 304 [2025-03-17 06:03:11,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:03:11,653 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 77 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:11,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1090 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:03:11,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-17 06:03:11,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 298. [2025-03-17 06:03:11,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 263 states have (on average 1.2357414448669202) internal successors, (325), 264 states have internal predecessors, (325), 29 states have call successors, (29), 5 states have call predecessors, (29), 5 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 06:03:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 383 transitions. [2025-03-17 06:03:11,670 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 383 transitions. Word has length 186 [2025-03-17 06:03:11,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:11,671 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 383 transitions. [2025-03-17 06:03:11,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 10 states have internal predecessors, (74), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:11,671 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 383 transitions. [2025-03-17 06:03:11,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 06:03:11,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:11,672 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:11,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 06:03:11,672 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:11,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:11,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1192219295, now seen corresponding path program 1 times [2025-03-17 06:03:11,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:11,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442498650] [2025-03-17 06:03:11,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:11,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:11,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 06:03:11,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 06:03:11,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:11,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:12,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:12,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:12,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442498650] [2025-03-17 06:03:12,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442498650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:12,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:12,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:03:12,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686922120] [2025-03-17 06:03:12,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:12,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:03:12,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:12,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:03:12,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:03:12,453 INFO L87 Difference]: Start difference. First operand 298 states and 383 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:12,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:12,678 INFO L93 Difference]: Finished difference Result 791 states and 1011 transitions. [2025-03-17 06:03:12,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:03:12,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 186 [2025-03-17 06:03:12,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:12,680 INFO L225 Difference]: With dead ends: 791 [2025-03-17 06:03:12,681 INFO L226 Difference]: Without dead ends: 494 [2025-03-17 06:03:12,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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-17 06:03:12,681 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 70 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:12,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 627 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:03:12,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-03-17 06:03:12,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 480. [2025-03-17 06:03:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 433 states have (on average 1.2401847575057736) internal successors, (537), 436 states have internal predecessors, (537), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-17 06:03:12,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 611 transitions. [2025-03-17 06:03:12,709 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 611 transitions. Word has length 186 [2025-03-17 06:03:12,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:12,709 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 611 transitions. [2025-03-17 06:03:12,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 611 transitions. [2025-03-17 06:03:12,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 06:03:12,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:12,711 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:12,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 06:03:12,711 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:12,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:12,711 INFO L85 PathProgramCache]: Analyzing trace with hash 964847072, now seen corresponding path program 1 times [2025-03-17 06:03:12,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:12,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208381079] [2025-03-17 06:03:12,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:12,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:12,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 06:03:12,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 06:03:12,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:12,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:13,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:13,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:13,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208381079] [2025-03-17 06:03:13,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208381079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:13,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:13,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:03:13,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605218854] [2025-03-17 06:03:13,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:13,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:03:13,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:13,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:03:13,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:03:13,487 INFO L87 Difference]: Start difference. First operand 480 states and 611 transitions. Second operand has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 10 states have internal predecessors, (74), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:13,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:13,926 INFO L93 Difference]: Finished difference Result 972 states and 1234 transitions. [2025-03-17 06:03:13,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 06:03:13,926 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 10 states have internal predecessors, (74), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 186 [2025-03-17 06:03:13,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:13,928 INFO L225 Difference]: With dead ends: 972 [2025-03-17 06:03:13,928 INFO L226 Difference]: Without dead ends: 493 [2025-03-17 06:03:13,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:03:13,929 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 184 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:13,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 1215 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:03:13,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-03-17 06:03:13,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 483. [2025-03-17 06:03:13,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 433 states have (on average 1.2286374133949192) internal successors, (532), 436 states have internal predecessors, (532), 39 states have call successors, (39), 10 states have call predecessors, (39), 10 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 06:03:13,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 610 transitions. [2025-03-17 06:03:13,960 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 610 transitions. Word has length 186 [2025-03-17 06:03:13,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:13,960 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 610 transitions. [2025-03-17 06:03:13,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 10 states have internal predecessors, (74), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:13,960 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 610 transitions. [2025-03-17 06:03:13,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 06:03:13,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:13,961 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:13,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 06:03:13,962 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:13,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:13,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1316292542, now seen corresponding path program 1 times [2025-03-17 06:03:13,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:13,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777334128] [2025-03-17 06:03:13,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:13,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:13,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 06:03:13,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 06:03:13,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:13,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:14,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:14,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:14,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777334128] [2025-03-17 06:03:14,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777334128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:14,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:14,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:03:14,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780852165] [2025-03-17 06:03:14,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:14,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:03:14,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:14,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:03:14,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:03:14,045 INFO L87 Difference]: Start difference. First operand 483 states and 610 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:14,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:14,083 INFO L93 Difference]: Finished difference Result 856 states and 1082 transitions. [2025-03-17 06:03:14,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:03:14,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 186 [2025-03-17 06:03:14,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:14,085 INFO L225 Difference]: With dead ends: 856 [2025-03-17 06:03:14,085 INFO L226 Difference]: Without dead ends: 374 [2025-03-17 06:03:14,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:03:14,086 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:14,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 653 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:03:14,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-17 06:03:14,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 327. [2025-03-17 06:03:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 291 states have (on average 1.2199312714776633) internal successors, (355), 292 states have internal predecessors, (355), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 06:03:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 413 transitions. [2025-03-17 06:03:14,106 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 413 transitions. Word has length 186 [2025-03-17 06:03:14,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:14,106 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 413 transitions. [2025-03-17 06:03:14,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:14,107 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 413 transitions. [2025-03-17 06:03:14,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 06:03:14,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:14,108 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:14,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 06:03:14,108 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:14,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:14,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1088920319, now seen corresponding path program 1 times [2025-03-17 06:03:14,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:14,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522595527] [2025-03-17 06:03:14,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:14,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:14,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 06:03:14,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 06:03:14,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:14,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:14,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:14,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:14,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522595527] [2025-03-17 06:03:14,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522595527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:14,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:14,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:03:14,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663604638] [2025-03-17 06:03:14,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:14,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:03:14,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:14,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:03:14,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:03:14,951 INFO L87 Difference]: Start difference. First operand 327 states and 413 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:15,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:15,188 INFO L93 Difference]: Finished difference Result 691 states and 871 transitions. [2025-03-17 06:03:15,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:03:15,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 186 [2025-03-17 06:03:15,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:15,190 INFO L225 Difference]: With dead ends: 691 [2025-03-17 06:03:15,190 INFO L226 Difference]: Without dead ends: 365 [2025-03-17 06:03:15,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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-17 06:03:15,191 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 66 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:15,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 741 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:03:15,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-17 06:03:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2025-03-17 06:03:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 320 states have (on average 1.21875) internal successors, (390), 322 states have internal predecessors, (390), 33 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 06:03:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 456 transitions. [2025-03-17 06:03:15,223 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 456 transitions. Word has length 186 [2025-03-17 06:03:15,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:15,225 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 456 transitions. [2025-03-17 06:03:15,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:15,225 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 456 transitions. [2025-03-17 06:03:15,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-17 06:03:15,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:15,226 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:15,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 06:03:15,227 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:15,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:15,227 INFO L85 PathProgramCache]: Analyzing trace with hash 67746802, now seen corresponding path program 1 times [2025-03-17 06:03:15,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:15,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309480436] [2025-03-17 06:03:15,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:15,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:15,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 06:03:15,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 06:03:15,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:15,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:15,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:15,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:15,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309480436] [2025-03-17 06:03:15,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309480436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:15,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:15,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:03:15,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100079124] [2025-03-17 06:03:15,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:15,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:03:15,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:15,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:03:15,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:03:15,991 INFO L87 Difference]: Start difference. First operand 362 states and 456 transitions. Second operand has 7 states, 6 states have (on average 12.5) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:16,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:16,576 INFO L93 Difference]: Finished difference Result 977 states and 1238 transitions. [2025-03-17 06:03:16,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:03:16,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.5) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 187 [2025-03-17 06:03:16,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:16,579 INFO L225 Difference]: With dead ends: 977 [2025-03-17 06:03:16,579 INFO L226 Difference]: Without dead ends: 616 [2025-03-17 06:03:16,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:03:16,580 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 247 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:16,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1018 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:03:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-03-17 06:03:16,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 520. [2025-03-17 06:03:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 458 states have (on average 1.2008733624454149) internal successors, (550), 462 states have internal predecessors, (550), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-17 06:03:16,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 644 transitions. [2025-03-17 06:03:16,617 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 644 transitions. Word has length 187 [2025-03-17 06:03:16,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:16,617 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 644 transitions. [2025-03-17 06:03:16,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.5) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:16,618 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 644 transitions. [2025-03-17 06:03:16,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-17 06:03:16,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:16,619 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:16,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 06:03:16,619 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:16,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:16,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1710208201, now seen corresponding path program 1 times [2025-03-17 06:03:16,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:16,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820562708] [2025-03-17 06:03:16,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:16,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:16,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 06:03:16,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 06:03:16,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:16,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:17,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:17,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820562708] [2025-03-17 06:03:17,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820562708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:17,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:17,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:03:17,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557233255] [2025-03-17 06:03:17,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:17,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:03:17,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:17,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:03:17,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:03:17,470 INFO L87 Difference]: Start difference. First operand 520 states and 644 transitions. Second operand has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 10 states have internal predecessors, (75), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:18,003 INFO L93 Difference]: Finished difference Result 1534 states and 1896 transitions. [2025-03-17 06:03:18,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:03:18,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 10 states have internal predecessors, (75), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 187 [2025-03-17 06:03:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:18,006 INFO L225 Difference]: With dead ends: 1534 [2025-03-17 06:03:18,006 INFO L226 Difference]: Without dead ends: 1015 [2025-03-17 06:03:18,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:03:18,007 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 202 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:18,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 873 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:03:18,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2025-03-17 06:03:18,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 983. [2025-03-17 06:03:18,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 869 states have (on average 1.188722669735328) internal successors, (1033), 878 states have internal predecessors, (1033), 85 states have call successors, (85), 28 states have call predecessors, (85), 28 states have return successors, (85), 76 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-17 06:03:18,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1203 transitions. [2025-03-17 06:03:18,079 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1203 transitions. Word has length 187 [2025-03-17 06:03:18,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:18,080 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1203 transitions. [2025-03-17 06:03:18,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 10 states have internal predecessors, (75), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:18,080 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1203 transitions. [2025-03-17 06:03:18,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-17 06:03:18,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:18,082 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:18,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 06:03:18,082 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:18,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash -951955096, now seen corresponding path program 1 times [2025-03-17 06:03:18,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:18,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869608055] [2025-03-17 06:03:18,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:18,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:18,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 06:03:18,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 06:03:18,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:18,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:18,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:18,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869608055] [2025-03-17 06:03:18,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869608055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:18,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:18,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:03:18,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915283719] [2025-03-17 06:03:18,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:18,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:03:18,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:18,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:03:18,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:03:18,792 INFO L87 Difference]: Start difference. First operand 983 states and 1203 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:19,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:19,203 INFO L93 Difference]: Finished difference Result 2471 states and 3026 transitions. [2025-03-17 06:03:19,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:03:19,204 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 187 [2025-03-17 06:03:19,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:19,208 INFO L225 Difference]: With dead ends: 2471 [2025-03-17 06:03:19,209 INFO L226 Difference]: Without dead ends: 1489 [2025-03-17 06:03:19,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:03:19,210 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 192 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:19,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 773 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:03:19,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2025-03-17 06:03:19,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1476. [2025-03-17 06:03:19,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1312 states have (on average 1.1852134146341464) internal successors, (1555), 1326 states have internal predecessors, (1555), 121 states have call successors, (121), 42 states have call predecessors, (121), 42 states have return successors, (121), 107 states have call predecessors, (121), 121 states have call successors, (121) [2025-03-17 06:03:19,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 1797 transitions. [2025-03-17 06:03:19,313 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 1797 transitions. Word has length 187 [2025-03-17 06:03:19,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:19,313 INFO L471 AbstractCegarLoop]: Abstraction has 1476 states and 1797 transitions. [2025-03-17 06:03:19,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:19,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 1797 transitions. [2025-03-17 06:03:19,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-17 06:03:19,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:19,315 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:19,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 06:03:19,316 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:19,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:19,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1148468601, now seen corresponding path program 1 times [2025-03-17 06:03:19,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:19,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853885186] [2025-03-17 06:03:19,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:19,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:19,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 06:03:19,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 06:03:19,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:19,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:19,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:19,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853885186] [2025-03-17 06:03:19,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853885186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:19,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:19,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:03:19,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903049741] [2025-03-17 06:03:19,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:19,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:03:19,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:19,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:03:19,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:03:19,687 INFO L87 Difference]: Start difference. First operand 1476 states and 1797 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:20,093 INFO L93 Difference]: Finished difference Result 3553 states and 4332 transitions. [2025-03-17 06:03:20,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:03:20,094 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 187 [2025-03-17 06:03:20,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:20,100 INFO L225 Difference]: With dead ends: 3553 [2025-03-17 06:03:20,100 INFO L226 Difference]: Without dead ends: 2078 [2025-03-17 06:03:20,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:03:20,102 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 134 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:20,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1539 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:03:20,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2025-03-17 06:03:20,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1779. [2025-03-17 06:03:20,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1603 states have (on average 1.1746724890829694) internal successors, (1883), 1618 states have internal predecessors, (1883), 129 states have call successors, (129), 46 states have call predecessors, (129), 46 states have return successors, (129), 114 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-17 06:03:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2141 transitions. [2025-03-17 06:03:20,225 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2141 transitions. Word has length 187 [2025-03-17 06:03:20,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:20,225 INFO L471 AbstractCegarLoop]: Abstraction has 1779 states and 2141 transitions. [2025-03-17 06:03:20,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:20,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2141 transitions. [2025-03-17 06:03:20,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-17 06:03:20,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:20,227 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:20,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-17 06:03:20,227 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:20,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:20,228 INFO L85 PathProgramCache]: Analyzing trace with hash 509624903, now seen corresponding path program 1 times [2025-03-17 06:03:20,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:20,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613812010] [2025-03-17 06:03:20,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:20,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:20,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 06:03:20,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 06:03:20,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:20,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:20,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:20,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613812010] [2025-03-17 06:03:20,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613812010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:20,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:20,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:03:20,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134926170] [2025-03-17 06:03:20,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:20,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:03:20,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:20,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:03:20,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:03:20,898 INFO L87 Difference]: Start difference. First operand 1779 states and 2141 transitions. Second operand has 7 states, 5 states have (on average 15.0) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-17 06:03:21,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:21,319 INFO L93 Difference]: Finished difference Result 4441 states and 5334 transitions. [2025-03-17 06:03:21,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:03:21,319 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 15.0) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) Word has length 187 [2025-03-17 06:03:21,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:21,327 INFO L225 Difference]: With dead ends: 4441 [2025-03-17 06:03:21,327 INFO L226 Difference]: Without dead ends: 2695 [2025-03-17 06:03:21,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:03:21,330 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 132 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:21,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 664 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:03:21,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states. [2025-03-17 06:03:21,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2685. [2025-03-17 06:03:21,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2685 states, 2410 states have (on average 1.1651452282157677) internal successors, (2808), 2435 states have internal predecessors, (2808), 199 states have call successors, (199), 75 states have call predecessors, (199), 75 states have return successors, (199), 174 states have call predecessors, (199), 199 states have call successors, (199) [2025-03-17 06:03:21,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 3206 transitions. [2025-03-17 06:03:21,548 INFO L78 Accepts]: Start accepts. Automaton has 2685 states and 3206 transitions. Word has length 187 [2025-03-17 06:03:21,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:21,549 INFO L471 AbstractCegarLoop]: Abstraction has 2685 states and 3206 transitions. [2025-03-17 06:03:21,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 15.0) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-17 06:03:21,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2685 states and 3206 transitions. [2025-03-17 06:03:21,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 06:03:21,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:21,553 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:21,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-17 06:03:21,553 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:21,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:21,553 INFO L85 PathProgramCache]: Analyzing trace with hash -443519612, now seen corresponding path program 1 times [2025-03-17 06:03:21,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:21,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103502098] [2025-03-17 06:03:21,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:21,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:21,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 06:03:21,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 06:03:21,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:21,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:22,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:22,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103502098] [2025-03-17 06:03:22,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103502098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:22,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:22,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:03:22,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002627507] [2025-03-17 06:03:22,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:22,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:03:22,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:22,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:03:22,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:03:22,846 INFO L87 Difference]: Start difference. First operand 2685 states and 3206 transitions. Second operand has 9 states, 8 states have (on average 9.5) internal successors, (76), 9 states have internal predecessors, (76), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:23,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:23,599 INFO L93 Difference]: Finished difference Result 5906 states and 7053 transitions. [2025-03-17 06:03:23,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:03:23,600 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 9 states have internal predecessors, (76), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 188 [2025-03-17 06:03:23,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:23,611 INFO L225 Difference]: With dead ends: 5906 [2025-03-17 06:03:23,611 INFO L226 Difference]: Without dead ends: 3262 [2025-03-17 06:03:23,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:03:23,614 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 76 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:23,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1132 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:03:23,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2025-03-17 06:03:23,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 2757. [2025-03-17 06:03:23,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2757 states, 2422 states have (on average 1.1684558216350125) internal successors, (2830), 2452 states have internal predecessors, (2830), 239 states have call successors, (239), 95 states have call predecessors, (239), 95 states have return successors, (239), 209 states have call predecessors, (239), 239 states have call successors, (239) [2025-03-17 06:03:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 3308 transitions. [2025-03-17 06:03:23,834 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 3308 transitions. Word has length 188 [2025-03-17 06:03:23,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:23,834 INFO L471 AbstractCegarLoop]: Abstraction has 2757 states and 3308 transitions. [2025-03-17 06:03:23,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 9 states have internal predecessors, (76), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:23,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 3308 transitions. [2025-03-17 06:03:23,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-17 06:03:23,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:23,837 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:23,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-17 06:03:23,837 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:23,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:23,837 INFO L85 PathProgramCache]: Analyzing trace with hash 203690603, now seen corresponding path program 1 times [2025-03-17 06:03:23,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:23,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170975621] [2025-03-17 06:03:23,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:23,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:23,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-17 06:03:23,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-17 06:03:23,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:23,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:24,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:24,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170975621] [2025-03-17 06:03:24,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170975621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:24,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:24,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:03:24,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958253021] [2025-03-17 06:03:24,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:24,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:03:24,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:24,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:03:24,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:03:24,767 INFO L87 Difference]: Start difference. First operand 2757 states and 3308 transitions. Second operand has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 10 states have internal predecessors, (77), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:25,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:25,421 INFO L93 Difference]: Finished difference Result 6440 states and 7719 transitions. [2025-03-17 06:03:25,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:03:25,422 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 10 states have internal predecessors, (77), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 189 [2025-03-17 06:03:25,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:25,432 INFO L225 Difference]: With dead ends: 6440 [2025-03-17 06:03:25,432 INFO L226 Difference]: Without dead ends: 3724 [2025-03-17 06:03:25,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:03:25,436 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 205 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:25,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1148 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:03:25,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2025-03-17 06:03:25,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 2990. [2025-03-17 06:03:25,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2990 states, 2652 states have (on average 1.1647812971342384) internal successors, (3089), 2682 states have internal predecessors, (3089), 241 states have call successors, (241), 96 states have call predecessors, (241), 96 states have return successors, (241), 211 states have call predecessors, (241), 241 states have call successors, (241) [2025-03-17 06:03:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 3571 transitions. [2025-03-17 06:03:25,779 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 3571 transitions. Word has length 189 [2025-03-17 06:03:25,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:25,779 INFO L471 AbstractCegarLoop]: Abstraction has 2990 states and 3571 transitions. [2025-03-17 06:03:25,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 10 states have internal predecessors, (77), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:25,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 3571 transitions. [2025-03-17 06:03:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-17 06:03:25,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:25,783 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:25,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-17 06:03:25,783 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:25,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:25,783 INFO L85 PathProgramCache]: Analyzing trace with hash 7177098, now seen corresponding path program 1 times [2025-03-17 06:03:25,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:25,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880367600] [2025-03-17 06:03:25,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:25,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:25,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-17 06:03:25,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-17 06:03:25,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:25,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:26,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:26,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:26,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880367600] [2025-03-17 06:03:26,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880367600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:26,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:26,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:03:26,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50984261] [2025-03-17 06:03:26,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:26,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:03:26,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:26,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:03:26,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:03:26,459 INFO L87 Difference]: Start difference. First operand 2990 states and 3571 transitions. Second operand has 9 states, 7 states have (on average 11.0) internal successors, (77), 9 states have internal predecessors, (77), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-17 06:03:27,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:27,031 INFO L93 Difference]: Finished difference Result 6415 states and 7655 transitions. [2025-03-17 06:03:27,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:03:27,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 11.0) internal successors, (77), 9 states have internal predecessors, (77), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) Word has length 189 [2025-03-17 06:03:27,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:27,041 INFO L225 Difference]: With dead ends: 6415 [2025-03-17 06:03:27,041 INFO L226 Difference]: Without dead ends: 3466 [2025-03-17 06:03:27,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:03:27,046 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 80 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:27,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 885 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:03:27,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3466 states. [2025-03-17 06:03:27,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3466 to 3177. [2025-03-17 06:03:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3177 states, 2838 states have (on average 1.1578576462297392) internal successors, (3286), 2868 states have internal predecessors, (3286), 241 states have call successors, (241), 97 states have call predecessors, (241), 97 states have return successors, (241), 211 states have call predecessors, (241), 241 states have call successors, (241) [2025-03-17 06:03:27,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 3177 states and 3768 transitions. [2025-03-17 06:03:27,293 INFO L78 Accepts]: Start accepts. Automaton has 3177 states and 3768 transitions. Word has length 189 [2025-03-17 06:03:27,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:27,294 INFO L471 AbstractCegarLoop]: Abstraction has 3177 states and 3768 transitions. [2025-03-17 06:03:27,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 11.0) internal successors, (77), 9 states have internal predecessors, (77), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-17 06:03:27,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3177 states and 3768 transitions. [2025-03-17 06:03:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-17 06:03:27,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:27,297 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:27,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-17 06:03:27,297 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:27,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:27,297 INFO L85 PathProgramCache]: Analyzing trace with hash 136259817, now seen corresponding path program 1 times [2025-03-17 06:03:27,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:27,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124820653] [2025-03-17 06:03:27,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:27,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:27,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-17 06:03:27,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-17 06:03:27,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:27,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:27,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:27,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:27,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124820653] [2025-03-17 06:03:27,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124820653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:27,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:27,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:03:27,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734688285] [2025-03-17 06:03:27,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:27,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:03:27,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:27,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:03:27,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:03:27,917 INFO L87 Difference]: Start difference. First operand 3177 states and 3768 transitions. Second operand has 7 states, 5 states have (on average 15.4) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-17 06:03:28,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:28,423 INFO L93 Difference]: Finished difference Result 6295 states and 7463 transitions. [2025-03-17 06:03:28,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:03:28,424 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 15.4) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) Word has length 189 [2025-03-17 06:03:28,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:28,430 INFO L225 Difference]: With dead ends: 6295 [2025-03-17 06:03:28,431 INFO L226 Difference]: Without dead ends: 3159 [2025-03-17 06:03:28,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:03:28,434 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 74 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:28,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 652 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:03:28,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3159 states. [2025-03-17 06:03:28,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3159 to 2650. [2025-03-17 06:03:28,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2650 states, 2384 states have (on average 1.1505872483221478) internal successors, (2743), 2407 states have internal predecessors, (2743), 189 states have call successors, (189), 76 states have call predecessors, (189), 76 states have return successors, (189), 166 states have call predecessors, (189), 189 states have call successors, (189) [2025-03-17 06:03:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 3121 transitions. [2025-03-17 06:03:28,631 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 3121 transitions. Word has length 189 [2025-03-17 06:03:28,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:28,632 INFO L471 AbstractCegarLoop]: Abstraction has 2650 states and 3121 transitions. [2025-03-17 06:03:28,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 15.4) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-17 06:03:28,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 3121 transitions. [2025-03-17 06:03:28,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-17 06:03:28,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:28,634 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:28,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-17 06:03:28,635 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:28,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:28,635 INFO L85 PathProgramCache]: Analyzing trace with hash -39998205, now seen corresponding path program 1 times [2025-03-17 06:03:28,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:28,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81403155] [2025-03-17 06:03:28,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:28,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:28,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-17 06:03:28,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-17 06:03:28,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:28,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 06:03:29,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:29,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81403155] [2025-03-17 06:03:29,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81403155] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:03:29,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160883143] [2025-03-17 06:03:29,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:29,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:03:29,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:03:29,130 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-17 06:03:29,131 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-17 06:03:29,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-17 06:03:29,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-17 06:03:29,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:29,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:29,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 06:03:29,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:03:29,410 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 31 treesize of output 15 [2025-03-17 06:03:29,434 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 31 treesize of output 15 [2025-03-17 06:03:29,453 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 31 treesize of output 15 [2025-03-17 06:03:29,472 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 31 treesize of output 15 [2025-03-17 06:03:29,492 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 31 treesize of output 15 [2025-03-17 06:03:29,509 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 31 treesize of output 15 [2025-03-17 06:03:29,528 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 31 treesize of output 15 [2025-03-17 06:03:29,550 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 31 treesize of output 15 [2025-03-17 06:03:29,568 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 31 treesize of output 15 [2025-03-17 06:03:29,599 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 31 treesize of output 15 [2025-03-17 06:03:29,608 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 50 treesize of output 36 [2025-03-17 06:03:29,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2025-03-17 06:03:29,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:29,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2025-03-17 06:03:29,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:29,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 38 [2025-03-17 06:03:29,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:29,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 38 [2025-03-17 06:03:29,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:29,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 47 [2025-03-17 06:03:29,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:29,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 74 treesize of output 50 [2025-03-17 06:03:29,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:29,767 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 68 treesize of output 26 [2025-03-17 06:03:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 256 proven. 57 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2025-03-17 06:03:29,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:03:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 06:03:30,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160883143] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:03:30,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:03:30,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 17 [2025-03-17 06:03:30,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878228365] [2025-03-17 06:03:30,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:03:30,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 06:03:30,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:30,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 06:03:30,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:03:30,103 INFO L87 Difference]: Start difference. First operand 2650 states and 3121 transitions. Second operand has 17 states, 14 states have (on average 10.071428571428571) internal successors, (141), 17 states have internal predecessors, (141), 6 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (63), 3 states have call predecessors, (63), 6 states have call successors, (63) [2025-03-17 06:03:32,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:32,099 INFO L93 Difference]: Finished difference Result 6050 states and 7146 transitions. [2025-03-17 06:03:32,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-17 06:03:32,103 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 10.071428571428571) internal successors, (141), 17 states have internal predecessors, (141), 6 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (63), 3 states have call predecessors, (63), 6 states have call successors, (63) Word has length 189 [2025-03-17 06:03:32,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:32,112 INFO L225 Difference]: With dead ends: 6050 [2025-03-17 06:03:32,112 INFO L226 Difference]: Without dead ends: 3347 [2025-03-17 06:03:32,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 365 SyntacticMatches, 15 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=682, Invalid=3478, Unknown=0, NotChecked=0, Total=4160 [2025-03-17 06:03:32,116 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 451 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 2434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:32,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1031 Invalid, 2434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 06:03:32,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3347 states. [2025-03-17 06:03:32,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3347 to 2781. [2025-03-17 06:03:32,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 2428 states have (on average 1.1375617792421746) internal successors, (2762), 2452 states have internal predecessors, (2762), 248 states have call successors, (248), 104 states have call predecessors, (248), 104 states have return successors, (248), 224 states have call predecessors, (248), 248 states have call successors, (248) [2025-03-17 06:03:32,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3258 transitions. [2025-03-17 06:03:32,375 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3258 transitions. Word has length 189 [2025-03-17 06:03:32,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:32,375 INFO L471 AbstractCegarLoop]: Abstraction has 2781 states and 3258 transitions. [2025-03-17 06:03:32,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 10.071428571428571) internal successors, (141), 17 states have internal predecessors, (141), 6 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (63), 3 states have call predecessors, (63), 6 states have call successors, (63) [2025-03-17 06:03:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3258 transitions. [2025-03-17 06:03:32,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-17 06:03:32,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:32,378 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:32,386 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-17 06:03:32,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:03:32,578 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:32,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:32,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1152640156, now seen corresponding path program 1 times [2025-03-17 06:03:32,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:32,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446607189] [2025-03-17 06:03:32,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:32,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:32,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-17 06:03:32,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-17 06:03:32,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:32,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 06:03:33,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:33,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446607189] [2025-03-17 06:03:33,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446607189] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:03:33,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094052530] [2025-03-17 06:03:33,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:33,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:03:33,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:03:33,056 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-17 06:03:33,057 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-17 06:03:33,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-17 06:03:33,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-17 06:03:33,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:33,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:33,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 06:03:33,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:03:33,329 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 31 treesize of output 15 [2025-03-17 06:03:33,350 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 31 treesize of output 15 [2025-03-17 06:03:33,367 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 31 treesize of output 15 [2025-03-17 06:03:33,386 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 31 treesize of output 15 [2025-03-17 06:03:33,405 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 31 treesize of output 15 [2025-03-17 06:03:33,423 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 31 treesize of output 15 [2025-03-17 06:03:33,441 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 31 treesize of output 15 [2025-03-17 06:03:33,461 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 31 treesize of output 15 [2025-03-17 06:03:33,481 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 31 treesize of output 15 [2025-03-17 06:03:33,523 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 41 treesize of output 23 [2025-03-17 06:03:33,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 256 proven. 57 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2025-03-17 06:03:33,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:03:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 06:03:33,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094052530] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:03:33,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:03:33,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2025-03-17 06:03:33,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031813410] [2025-03-17 06:03:33,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:03:33,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:03:33,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:33,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:03:33,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:03:33,805 INFO L87 Difference]: Start difference. First operand 2781 states and 3258 transitions. Second operand has 14 states, 11 states have (on average 10.727272727272727) internal successors, (118), 14 states have internal predecessors, (118), 6 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (63), 3 states have call predecessors, (63), 6 states have call successors, (63) [2025-03-17 06:03:34,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:34,701 INFO L93 Difference]: Finished difference Result 4779 states and 5577 transitions. [2025-03-17 06:03:34,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 06:03:34,707 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 10.727272727272727) internal successors, (118), 14 states have internal predecessors, (118), 6 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (63), 3 states have call predecessors, (63), 6 states have call successors, (63) Word has length 189 [2025-03-17 06:03:34,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:34,712 INFO L225 Difference]: With dead ends: 4779 [2025-03-17 06:03:34,713 INFO L226 Difference]: Without dead ends: 2051 [2025-03-17 06:03:34,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 371 SyntacticMatches, 10 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=856, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 06:03:34,717 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 349 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:34,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 517 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:03:34,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2025-03-17 06:03:34,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 1905. [2025-03-17 06:03:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1905 states, 1623 states have (on average 1.1324707332101047) internal successors, (1838), 1641 states have internal predecessors, (1838), 196 states have call successors, (196), 85 states have call predecessors, (196), 85 states have return successors, (196), 178 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-17 06:03:34,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 2230 transitions. [2025-03-17 06:03:34,929 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 2230 transitions. Word has length 189 [2025-03-17 06:03:34,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:34,930 INFO L471 AbstractCegarLoop]: Abstraction has 1905 states and 2230 transitions. [2025-03-17 06:03:34,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 10.727272727272727) internal successors, (118), 14 states have internal predecessors, (118), 6 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (63), 3 states have call predecessors, (63), 6 states have call successors, (63) [2025-03-17 06:03:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2230 transitions. [2025-03-17 06:03:34,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 06:03:34,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:34,932 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:34,951 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-17 06:03:35,132 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,SelfDestructingSolverStorable44 [2025-03-17 06:03:35,132 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:35,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:35,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1547717607, now seen corresponding path program 1 times [2025-03-17 06:03:35,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:35,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696881375] [2025-03-17 06:03:35,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:35,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:35,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 06:03:35,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 06:03:35,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:35,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:35,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:35,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:35,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696881375] [2025-03-17 06:03:35,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696881375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:35,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:35,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:03:35,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835990096] [2025-03-17 06:03:35,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:35,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:03:35,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:35,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:03:35,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:03:35,214 INFO L87 Difference]: Start difference. First operand 1905 states and 2230 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:35,422 INFO L93 Difference]: Finished difference Result 3528 states and 4142 transitions. [2025-03-17 06:03:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:03:35,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 192 [2025-03-17 06:03:35,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:35,426 INFO L225 Difference]: With dead ends: 3528 [2025-03-17 06:03:35,426 INFO L226 Difference]: Without dead ends: 1680 [2025-03-17 06:03:35,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:03:35,429 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:35,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 483 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:03:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2025-03-17 06:03:35,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1680. [2025-03-17 06:03:35,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1680 states, 1398 states have (on average 1.1309012875536482) internal successors, (1581), 1416 states have internal predecessors, (1581), 196 states have call successors, (196), 85 states have call predecessors, (196), 85 states have return successors, (196), 178 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-17 06:03:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 1973 transitions. [2025-03-17 06:03:35,640 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 1973 transitions. Word has length 192 [2025-03-17 06:03:35,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:35,640 INFO L471 AbstractCegarLoop]: Abstraction has 1680 states and 1973 transitions. [2025-03-17 06:03:35,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:35,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 1973 transitions. [2025-03-17 06:03:35,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 06:03:35,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:35,641 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:35,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-17 06:03:35,642 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:35,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:35,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1677093962, now seen corresponding path program 1 times [2025-03-17 06:03:35,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:35,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853396462] [2025-03-17 06:03:35,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:35,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:35,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 06:03:35,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 06:03:35,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:35,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:36,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 06:03:36,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:36,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853396462] [2025-03-17 06:03:36,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853396462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:03:36,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755609827] [2025-03-17 06:03:36,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:36,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:03:36,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:03:36,390 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-17 06:03:36,390 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-17 06:03:36,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 06:03:36,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 06:03:36,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:36,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:36,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 06:03:36,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:03:36,626 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 31 treesize of output 15 [2025-03-17 06:03:36,648 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 31 treesize of output 15 [2025-03-17 06:03:36,668 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 31 treesize of output 15 [2025-03-17 06:03:36,686 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 31 treesize of output 15 [2025-03-17 06:03:36,706 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 31 treesize of output 15 [2025-03-17 06:03:36,724 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 31 treesize of output 15 [2025-03-17 06:03:36,752 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 31 treesize of output 15 [2025-03-17 06:03:36,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 25 treesize of output 24 [2025-03-17 06:03:36,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:36,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-03-17 06:03:36,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:36,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-03-17 06:03:36,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:36,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 40 treesize of output 45 [2025-03-17 06:03:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 508 proven. 39 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-17 06:03:36,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:03:37,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 06:03:37,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755609827] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:03:37,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:03:37,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 18 [2025-03-17 06:03:37,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893769850] [2025-03-17 06:03:37,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:03:37,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 06:03:37,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:37,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 06:03:37,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:03:37,101 INFO L87 Difference]: Start difference. First operand 1680 states and 1973 transitions. Second operand has 18 states, 16 states have (on average 7.0625) internal successors, (113), 18 states have internal predecessors, (113), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37) [2025-03-17 06:03:38,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:38,427 INFO L93 Difference]: Finished difference Result 3638 states and 4250 transitions. [2025-03-17 06:03:38,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 06:03:38,428 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 7.0625) internal successors, (113), 18 states have internal predecessors, (113), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37) Word has length 192 [2025-03-17 06:03:38,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:38,433 INFO L225 Difference]: With dead ends: 3638 [2025-03-17 06:03:38,433 INFO L226 Difference]: Without dead ends: 2015 [2025-03-17 06:03:38,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 379 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=1056, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 06:03:38,436 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 477 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:38,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 624 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:03:38,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2025-03-17 06:03:38,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1266. [2025-03-17 06:03:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1044 states have (on average 1.1293103448275863) internal successors, (1179), 1056 states have internal predecessors, (1179), 154 states have call successors, (154), 67 states have call predecessors, (154), 67 states have return successors, (154), 142 states have call predecessors, (154), 154 states have call successors, (154) [2025-03-17 06:03:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1487 transitions. [2025-03-17 06:03:38,643 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1487 transitions. Word has length 192 [2025-03-17 06:03:38,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:38,643 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1487 transitions. [2025-03-17 06:03:38,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 7.0625) internal successors, (113), 18 states have internal predecessors, (113), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37) [2025-03-17 06:03:38,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1487 transitions. [2025-03-17 06:03:38,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 06:03:38,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:38,645 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:38,653 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-17 06:03:38,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:03:38,846 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:38,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:38,846 INFO L85 PathProgramCache]: Analyzing trace with hash -300802026, now seen corresponding path program 1 times [2025-03-17 06:03:38,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:38,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428295516] [2025-03-17 06:03:38,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:38,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:38,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 06:03:38,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 06:03:38,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:38,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:39,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 30 proven. 36 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 06:03:39,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:39,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428295516] [2025-03-17 06:03:39,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428295516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:03:39,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117224081] [2025-03-17 06:03:39,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:39,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:03:39,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:03:39,396 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-17 06:03:39,397 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-17 06:03:39,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 06:03:39,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 06:03:39,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:39,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:39,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 06:03:39,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:03:39,659 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 33 treesize of output 17 [2025-03-17 06:03:39,678 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 33 treesize of output 17 [2025-03-17 06:03:39,696 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 33 treesize of output 17 [2025-03-17 06:03:39,717 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 33 treesize of output 17 [2025-03-17 06:03:39,736 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 33 treesize of output 17 [2025-03-17 06:03:39,772 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 33 treesize of output 17 [2025-03-17 06:03:39,786 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 52 treesize of output 38 [2025-03-17 06:03:39,789 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 56 treesize of output 48 [2025-03-17 06:03:39,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2025-03-17 06:03:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 522 proven. 36 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-03-17 06:03:39,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:03:39,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 30 proven. 36 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 06:03:39,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117224081] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:03:39,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:03:39,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2025-03-17 06:03:39,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461827292] [2025-03-17 06:03:39,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:03:39,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:03:39,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:39,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:03:39,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:03:39,997 INFO L87 Difference]: Start difference. First operand 1266 states and 1487 transitions. Second operand has 11 states, 8 states have (on average 11.375) internal successors, (91), 11 states have internal predecessors, (91), 5 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 5 states have call successors, (37) [2025-03-17 06:03:40,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:40,506 INFO L93 Difference]: Finished difference Result 1797 states and 2097 transitions. [2025-03-17 06:03:40,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 06:03:40,506 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 11.375) internal successors, (91), 11 states have internal predecessors, (91), 5 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 5 states have call successors, (37) Word has length 192 [2025-03-17 06:03:40,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:40,509 INFO L225 Difference]: With dead ends: 1797 [2025-03-17 06:03:40,509 INFO L226 Difference]: Without dead ends: 588 [2025-03-17 06:03:40,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 381 SyntacticMatches, 9 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:03:40,512 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 162 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:40,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 375 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:03:40,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-03-17 06:03:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 522. [2025-03-17 06:03:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 420 states have (on average 1.1095238095238096) internal successors, (466), 424 states have internal predecessors, (466), 66 states have call successors, (66), 35 states have call predecessors, (66), 35 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 06:03:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 598 transitions. [2025-03-17 06:03:40,592 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 598 transitions. Word has length 192 [2025-03-17 06:03:40,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:40,592 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 598 transitions. [2025-03-17 06:03:40,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 11.375) internal successors, (91), 11 states have internal predecessors, (91), 5 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 5 states have call successors, (37) [2025-03-17 06:03:40,593 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 598 transitions. [2025-03-17 06:03:40,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-17 06:03:40,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:40,593 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:40,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 06:03:40,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:03:40,794 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:40,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:40,795 INFO L85 PathProgramCache]: Analyzing trace with hash -716999884, now seen corresponding path program 1 times [2025-03-17 06:03:40,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:40,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362007051] [2025-03-17 06:03:40,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:40,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:40,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 06:03:40,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 06:03:40,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:40,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:41,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:41,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362007051] [2025-03-17 06:03:41,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362007051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:41,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:41,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:03:41,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312714391] [2025-03-17 06:03:41,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:41,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:03:41,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:41,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:03:41,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:03:41,180 INFO L87 Difference]: Start difference. First operand 522 states and 598 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:41,443 INFO L93 Difference]: Finished difference Result 983 states and 1129 transitions. [2025-03-17 06:03:41,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:03:41,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 194 [2025-03-17 06:03:41,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:41,446 INFO L225 Difference]: With dead ends: 983 [2025-03-17 06:03:41,446 INFO L226 Difference]: Without dead ends: 522 [2025-03-17 06:03:41,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:03:41,447 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 109 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:41,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 253 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:03:41,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-17 06:03:41,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2025-03-17 06:03:41,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 420 states have (on average 1.1) internal successors, (462), 424 states have internal predecessors, (462), 66 states have call successors, (66), 35 states have call predecessors, (66), 35 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 06:03:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 594 transitions. [2025-03-17 06:03:41,525 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 594 transitions. Word has length 194 [2025-03-17 06:03:41,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:41,526 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 594 transitions. [2025-03-17 06:03:41,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:41,526 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 594 transitions. [2025-03-17 06:03:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-17 06:03:41,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:41,527 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:41,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-17 06:03:41,527 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:41,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:41,527 INFO L85 PathProgramCache]: Analyzing trace with hash 268084502, now seen corresponding path program 1 times [2025-03-17 06:03:41,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:41,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237979406] [2025-03-17 06:03:41,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:41,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:41,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 06:03:41,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 06:03:41,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:41,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:42,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:42,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237979406] [2025-03-17 06:03:42,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237979406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:42,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:42,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:03:42,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326993040] [2025-03-17 06:03:42,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:42,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:03:42,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:42,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:03:42,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:03:42,602 INFO L87 Difference]: Start difference. First operand 522 states and 594 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:43,328 INFO L93 Difference]: Finished difference Result 1414 states and 1609 transitions. [2025-03-17 06:03:43,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:03:43,328 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 196 [2025-03-17 06:03:43,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:43,331 INFO L225 Difference]: With dead ends: 1414 [2025-03-17 06:03:43,331 INFO L226 Difference]: Without dead ends: 953 [2025-03-17 06:03:43,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:03:43,332 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 79 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:43,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1097 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:03:43,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-17 06:03:43,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 836. [2025-03-17 06:03:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 687 states have (on average 1.1048034934497817) internal successors, (759), 694 states have internal predecessors, (759), 96 states have call successors, (96), 52 states have call predecessors, (96), 52 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 06:03:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 951 transitions. [2025-03-17 06:03:43,458 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 951 transitions. Word has length 196 [2025-03-17 06:03:43,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:43,459 INFO L471 AbstractCegarLoop]: Abstraction has 836 states and 951 transitions. [2025-03-17 06:03:43,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:43,459 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 951 transitions. [2025-03-17 06:03:43,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-17 06:03:43,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:43,460 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:43,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-17 06:03:43,460 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:43,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:43,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1539369961, now seen corresponding path program 1 times [2025-03-17 06:03:43,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:43,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247578172] [2025-03-17 06:03:43,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:43,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:43,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 06:03:43,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 06:03:43,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:43,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:43,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:43,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247578172] [2025-03-17 06:03:43,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247578172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:43,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:43,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:03:43,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799696302] [2025-03-17 06:03:43,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:43,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:03:43,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:43,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:03:43,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:03:43,915 INFO L87 Difference]: Start difference. First operand 836 states and 951 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:44,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:44,244 INFO L93 Difference]: Finished difference Result 1614 states and 1834 transitions. [2025-03-17 06:03:44,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:03:44,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 196 [2025-03-17 06:03:44,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:44,247 INFO L225 Difference]: With dead ends: 1614 [2025-03-17 06:03:44,247 INFO L226 Difference]: Without dead ends: 839 [2025-03-17 06:03:44,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:03:44,250 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 73 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:44,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 365 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:03:44,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2025-03-17 06:03:44,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 720. [2025-03-17 06:03:44,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 594 states have (on average 1.101010101010101) internal successors, (654), 600 states have internal predecessors, (654), 82 states have call successors, (82), 43 states have call predecessors, (82), 43 states have return successors, (82), 76 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-17 06:03:44,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 818 transitions. [2025-03-17 06:03:44,358 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 818 transitions. Word has length 196 [2025-03-17 06:03:44,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:44,358 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 818 transitions. [2025-03-17 06:03:44,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:44,359 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 818 transitions. [2025-03-17 06:03:44,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-17 06:03:44,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:44,360 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:44,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-17 06:03:44,360 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:44,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:44,361 INFO L85 PathProgramCache]: Analyzing trace with hash 392157749, now seen corresponding path program 1 times [2025-03-17 06:03:44,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:44,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012289842] [2025-03-17 06:03:44,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:44,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:44,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 06:03:44,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 06:03:44,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:44,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:44,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:44,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:44,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012289842] [2025-03-17 06:03:44,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012289842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:44,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:44,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:03:44,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983872632] [2025-03-17 06:03:44,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:44,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:03:44,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:44,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:03:44,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:03:44,803 INFO L87 Difference]: Start difference. First operand 720 states and 818 transitions. Second operand has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:45,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:45,179 INFO L93 Difference]: Finished difference Result 1380 states and 1568 transitions. [2025-03-17 06:03:45,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:03:45,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 196 [2025-03-17 06:03:45,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:45,183 INFO L225 Difference]: With dead ends: 1380 [2025-03-17 06:03:45,183 INFO L226 Difference]: Without dead ends: 727 [2025-03-17 06:03:45,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:03:45,185 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 74 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:45,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 726 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:03:45,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-03-17 06:03:45,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 572. [2025-03-17 06:03:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 492 states have (on average 1.0975609756097562) internal successors, (540), 495 states have internal predecessors, (540), 52 states have call successors, (52), 27 states have call predecessors, (52), 27 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 06:03:45,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 644 transitions. [2025-03-17 06:03:45,257 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 644 transitions. Word has length 196 [2025-03-17 06:03:45,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:45,258 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 644 transitions. [2025-03-17 06:03:45,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:45,258 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 644 transitions. [2025-03-17 06:03:45,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-17 06:03:45,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:45,259 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:45,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-17 06:03:45,259 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:45,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:45,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1415296714, now seen corresponding path program 1 times [2025-03-17 06:03:45,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:45,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907327269] [2025-03-17 06:03:45,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:45,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:45,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 06:03:45,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 06:03:45,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:45,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:45,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:45,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:45,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907327269] [2025-03-17 06:03:45,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907327269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:45,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:45,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:03:45,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45062077] [2025-03-17 06:03:45,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:45,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:03:45,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:45,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:03:45,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:03:45,696 INFO L87 Difference]: Start difference. First operand 572 states and 644 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:46,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:46,141 INFO L93 Difference]: Finished difference Result 1288 states and 1459 transitions. [2025-03-17 06:03:46,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:03:46,142 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 196 [2025-03-17 06:03:46,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:46,145 INFO L225 Difference]: With dead ends: 1288 [2025-03-17 06:03:46,145 INFO L226 Difference]: Without dead ends: 783 [2025-03-17 06:03:46,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:03:46,146 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 109 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:46,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1731 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:03:46,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-03-17 06:03:46,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 560. [2025-03-17 06:03:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 480 states have (on average 1.09375) internal successors, (525), 483 states have internal predecessors, (525), 52 states have call successors, (52), 27 states have call predecessors, (52), 27 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 06:03:46,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 629 transitions. [2025-03-17 06:03:46,219 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 629 transitions. Word has length 196 [2025-03-17 06:03:46,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:46,219 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 629 transitions. [2025-03-17 06:03:46,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:46,219 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 629 transitions. [2025-03-17 06:03:46,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-17 06:03:46,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:46,220 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:46,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-17 06:03:46,220 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:46,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:46,220 INFO L85 PathProgramCache]: Analyzing trace with hash -780714064, now seen corresponding path program 1 times [2025-03-17 06:03:46,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:46,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69159375] [2025-03-17 06:03:46,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:46,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:46,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 06:03:46,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 06:03:46,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:46,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:46,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:46,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:46,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69159375] [2025-03-17 06:03:46,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69159375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:46,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:46,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:03:46,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146077336] [2025-03-17 06:03:46,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:46,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:03:46,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:46,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:03:46,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:03:46,598 INFO L87 Difference]: Start difference. First operand 560 states and 629 transitions. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:47,122 INFO L93 Difference]: Finished difference Result 953 states and 1075 transitions. [2025-03-17 06:03:47,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:03:47,122 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 198 [2025-03-17 06:03:47,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:47,125 INFO L225 Difference]: With dead ends: 953 [2025-03-17 06:03:47,125 INFO L226 Difference]: Without dead ends: 951 [2025-03-17 06:03:47,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:03:47,126 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 148 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:47,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1145 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:03:47,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-03-17 06:03:47,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 725. [2025-03-17 06:03:47,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 645 states have (on average 1.083720930232558) internal successors, (699), 648 states have internal predecessors, (699), 52 states have call successors, (52), 27 states have call predecessors, (52), 27 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 06:03:47,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 803 transitions. [2025-03-17 06:03:47,201 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 803 transitions. Word has length 198 [2025-03-17 06:03:47,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:47,201 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 803 transitions. [2025-03-17 06:03:47,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:47,202 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 803 transitions. [2025-03-17 06:03:47,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-17 06:03:47,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:47,203 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:47,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-17 06:03:47,203 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:47,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:47,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1446362674, now seen corresponding path program 1 times [2025-03-17 06:03:47,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:47,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896500569] [2025-03-17 06:03:47,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:47,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:47,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 06:03:47,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 06:03:47,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:47,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:48,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:48,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:48,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896500569] [2025-03-17 06:03:48,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896500569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:48,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:48,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 06:03:48,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128334595] [2025-03-17 06:03:48,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:48,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:03:48,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:48,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:03:48,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:03:48,555 INFO L87 Difference]: Start difference. First operand 725 states and 803 transitions. Second operand has 14 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:49,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:49,210 INFO L93 Difference]: Finished difference Result 774 states and 857 transitions. [2025-03-17 06:03:49,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 06:03:49,210 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 200 [2025-03-17 06:03:49,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:49,213 INFO L225 Difference]: With dead ends: 774 [2025-03-17 06:03:49,213 INFO L226 Difference]: Without dead ends: 772 [2025-03-17 06:03:49,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2025-03-17 06:03:49,213 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 196 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:49,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1016 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:03:49,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2025-03-17 06:03:49,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 727. [2025-03-17 06:03:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 647 states have (on average 1.0850077279752706) internal successors, (702), 650 states have internal predecessors, (702), 52 states have call successors, (52), 27 states have call predecessors, (52), 27 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 06:03:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 806 transitions. [2025-03-17 06:03:49,287 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 806 transitions. Word has length 200 [2025-03-17 06:03:49,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:49,288 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 806 transitions. [2025-03-17 06:03:49,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 06:03:49,288 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 806 transitions. [2025-03-17 06:03:49,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-17 06:03:49,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:49,289 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:49,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-17 06:03:49,289 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:49,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:49,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1961100941, now seen corresponding path program 1 times [2025-03-17 06:03:49,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:49,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564392644] [2025-03-17 06:03:49,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:49,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:49,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 06:03:49,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 06:03:49,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:49,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:49,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 06:03:49,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:49,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564392644] [2025-03-17 06:03:49,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564392644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:49,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:49,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:03:49,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601533058] [2025-03-17 06:03:49,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:49,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:03:49,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:49,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:03:49,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:03:49,439 INFO L87 Difference]: Start difference. First operand 727 states and 806 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:49,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:49,620 INFO L93 Difference]: Finished difference Result 1389 states and 1540 transitions. [2025-03-17 06:03:49,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:03:49,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 200 [2025-03-17 06:03:49,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:49,623 INFO L225 Difference]: With dead ends: 1389 [2025-03-17 06:03:49,623 INFO L226 Difference]: Without dead ends: 729 [2025-03-17 06:03:49,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:03:49,624 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 45 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:49,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 361 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:03:49,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-03-17 06:03:49,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 727. [2025-03-17 06:03:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 647 states have (on average 1.080370942812983) internal successors, (699), 650 states have internal predecessors, (699), 52 states have call successors, (52), 27 states have call predecessors, (52), 27 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 06:03:49,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 803 transitions. [2025-03-17 06:03:49,696 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 803 transitions. Word has length 200 [2025-03-17 06:03:49,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:49,697 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 803 transitions. [2025-03-17 06:03:49,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 06:03:49,697 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 803 transitions. [2025-03-17 06:03:49,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-17 06:03:49,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:49,698 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:49,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-17 06:03:49,698 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:49,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:49,699 INFO L85 PathProgramCache]: Analyzing trace with hash -429029259, now seen corresponding path program 1 times [2025-03-17 06:03:49,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:03:49,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075796262] [2025-03-17 06:03:49,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:49,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:03:49,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 06:03:49,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 06:03:49,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:49,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:50,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 06:03:50,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:03:50,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075796262] [2025-03-17 06:03:50,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075796262] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:03:50,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375628691] [2025-03-17 06:03:50,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:50,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:03:50,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:03:50,428 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:03:50,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 06:03:50,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 06:03:50,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 06:03:50,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:50,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:50,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 06:03:50,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:03:50,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 06:03:50,746 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 31 treesize of output 15 [2025-03-17 06:03:50,764 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 31 treesize of output 15 [2025-03-17 06:03:50,783 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 31 treesize of output 15 [2025-03-17 06:03:50,800 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 31 treesize of output 15 [2025-03-17 06:03:50,822 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 31 treesize of output 15 [2025-03-17 06:03:50,861 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 31 treesize of output 15 [2025-03-17 06:03:50,874 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 50 treesize of output 36 [2025-03-17 06:03:50,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2025-03-17 06:03:50,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:50,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2025-03-17 06:03:50,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:50,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 38 [2025-03-17 06:03:50,950 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 103 treesize of output 83 [2025-03-17 06:03:50,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:50,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 111 [2025-03-17 06:03:51,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 34 [2025-03-17 06:03:51,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:51,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 215 treesize of output 124 [2025-03-17 06:03:51,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:51,425 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 226 treesize of output 127 [2025-03-17 06:03:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 508 proven. 39 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-17 06:03:51,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:03:51,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-17 06:03:51,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375628691] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:03:51,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:03:51,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 16 [2025-03-17 06:03:51,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434456499] [2025-03-17 06:03:51,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:03:51,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 06:03:51,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:03:51,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 06:03:51,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:03:51,816 INFO L87 Difference]: Start difference. First operand 727 states and 803 transitions. Second operand has 16 states, 14 states have (on average 8.642857142857142) internal successors, (121), 16 states have internal predecessors, (121), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37) [2025-03-17 06:03:53,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:53,058 INFO L93 Difference]: Finished difference Result 1874 states and 2074 transitions. [2025-03-17 06:03:53,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-17 06:03:53,059 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 8.642857142857142) internal successors, (121), 16 states have internal predecessors, (121), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37) Word has length 200 [2025-03-17 06:03:53,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:53,062 INFO L225 Difference]: With dead ends: 1874 [2025-03-17 06:03:53,062 INFO L226 Difference]: Without dead ends: 1214 [2025-03-17 06:03:53,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 393 SyntacticMatches, 13 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=327, Invalid=1155, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 06:03:53,063 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 370 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:53,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 657 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:03:53,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states.