./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-83.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 a710c8a85a9b8babc674eadb463f38727995c780b4aae16a0530660db602c87a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:06:57,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:06:57,126 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:06:57,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:06:57,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:06:57,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:06:57,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:06:57,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:06:57,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:06:57,154 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:06:57,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:06:57,154 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:06:57,155 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:06:57,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:06:57,155 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:06:57,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:06:57,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:06:57,156 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:06:57,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:06:57,156 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:06:57,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:06:57,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:06:57,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:06:57,156 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:06:57,156 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:06:57,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:06:57,156 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:06:57,156 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:06:57,156 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:06:57,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:06:57,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:06:57,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:06:57,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:06:57,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:06:57,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:06:57,157 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:06:57,157 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:06:57,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:06:57,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:06:57,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:06:57,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:06:57,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:06:57,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:06:57,158 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 -> a710c8a85a9b8babc674eadb463f38727995c780b4aae16a0530660db602c87a [2025-03-08 17:06:57,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:06:57,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:06:57,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:06:57,396 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:06:57,396 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:06:57,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-83.i [2025-03-08 17:06:58,636 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7681ba755/43cead53612846649e6c77007cada32b/FLAG902d20157 [2025-03-08 17:06:58,869 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:06:58,869 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-83.i [2025-03-08 17:06:58,876 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7681ba755/43cead53612846649e6c77007cada32b/FLAG902d20157 [2025-03-08 17:06:58,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7681ba755/43cead53612846649e6c77007cada32b [2025-03-08 17:06:58,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:06:58,895 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:06:58,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:06:58,896 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:06:58,900 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:06:58,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:06:58" (1/1) ... [2025-03-08 17:06:58,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad2ecdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:58, skipping insertion in model container [2025-03-08 17:06:58,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:06:58" (1/1) ... [2025-03-08 17:06:58,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:06:59,027 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-sp_file-83.i[917,930] [2025-03-08 17:06:59,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:06:59,099 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:06:59,108 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-sp_file-83.i[917,930] [2025-03-08 17:06:59,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:06:59,160 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:06:59,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:59 WrapperNode [2025-03-08 17:06:59,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:06:59,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:06:59,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:06:59,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:06:59,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:59" (1/1) ... [2025-03-08 17:06:59,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:59" (1/1) ... [2025-03-08 17:06:59,213 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 521 [2025-03-08 17:06:59,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:06:59,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:06:59,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:06:59,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:06:59,220 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:59" (1/1) ... [2025-03-08 17:06:59,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:59" (1/1) ... [2025-03-08 17:06:59,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:59" (1/1) ... [2025-03-08 17:06:59,229 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-08 17:06:59,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:59" (1/1) ... [2025-03-08 17:06:59,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:59" (1/1) ... [2025-03-08 17:06:59,240 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:59" (1/1) ... [2025-03-08 17:06:59,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:59" (1/1) ... [2025-03-08 17:06:59,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:59" (1/1) ... [2025-03-08 17:06:59,251 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:59" (1/1) ... [2025-03-08 17:06:59,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:06:59,255 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:06:59,259 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:06:59,259 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:06:59,260 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:59" (1/1) ... [2025-03-08 17:06:59,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:06:59,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:06:59,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 17:06:59,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 17:06:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:06:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-08 17:06:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-08 17:06:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-08 17:06:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 17:06:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-08 17:06:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 17:06:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 17:06:59,308 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 17:06:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 17:06:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:06:59,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:06:59,405 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:06:59,407 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:06:59,824 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~mem78#1;havoc property_#t~ite103#1;havoc property_#t~mem92#1;havoc property_#t~mem79#1;havoc property_#t~ite82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite91#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem87#1;havoc property_#t~ite90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite97#1;havoc property_#t~mem96#1;havoc property_#t~ite102#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite122#1;havoc property_#t~mem110#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~bitwise109#1;havoc property_#t~ite119#1;havoc property_#t~mem116#1;havoc property_#t~mem111#1;havoc property_#t~ite114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem115#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite132#1;havoc property_#t~mem131#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite130#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~short133#1;havoc property_#t~mem134#1;havoc property_#t~short135#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2025-03-08 17:06:59,865 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2025-03-08 17:06:59,866 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:06:59,885 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:06:59,885 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:06:59,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:06:59 BoogieIcfgContainer [2025-03-08 17:06:59,886 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:06:59,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:06:59,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:06:59,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:06:59,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:06:58" (1/3) ... [2025-03-08 17:06:59,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a4b5e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:06:59, skipping insertion in model container [2025-03-08 17:06:59,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:06:59" (2/3) ... [2025-03-08 17:06:59,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a4b5e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:06:59, skipping insertion in model container [2025-03-08 17:06:59,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:06:59" (3/3) ... [2025-03-08 17:06:59,895 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-83.i [2025-03-08 17:06:59,906 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:06:59,907 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-83.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 17:06:59,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:06:59,966 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;@3c054add, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:06:59,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 17:06:59,970 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 98 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 17:06:59,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 17:06:59,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:59,982 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:59,982 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:59,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:59,987 INFO L85 PathProgramCache]: Analyzing trace with hash -2129860447, now seen corresponding path program 1 times [2025-03-08 17:06:59,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:06:59,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206925061] [2025-03-08 17:06:59,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:59,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:00,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 17:07:00,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 17:07:00,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:00,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-08 17:07:00,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:00,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206925061] [2025-03-08 17:07:00,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206925061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:07:00,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740368457] [2025-03-08 17:07:00,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:00,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:07:00,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:07:00,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:07:00,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 17:07:00,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 17:07:00,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 17:07:00,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:00,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:00,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 17:07:00,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:07:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-08 17:07:00,497 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:07:00,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740368457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:00,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:07:00,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 17:07:00,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476035658] [2025-03-08 17:07:00,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:00,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 17:07:00,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:00,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 17:07:00,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:07:00,516 INFO L87 Difference]: Start difference. First operand has 111 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 98 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 17:07:00,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:00,538 INFO L93 Difference]: Finished difference Result 216 states and 334 transitions. [2025-03-08 17:07:00,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 17:07:00,539 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2025-03-08 17:07:00,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:00,544 INFO L225 Difference]: With dead ends: 216 [2025-03-08 17:07:00,544 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 17:07:00,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:07:00,548 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:00,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:07:00,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 17:07:00,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-08 17:07:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 17:07:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2025-03-08 17:07:00,582 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 106 [2025-03-08 17:07:00,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:00,582 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2025-03-08 17:07:00,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 17:07:00,583 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2025-03-08 17:07:00,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 17:07:00,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:00,584 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:00,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 17:07:00,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 17:07:00,786 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:00,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:00,786 INFO L85 PathProgramCache]: Analyzing trace with hash -392751350, now seen corresponding path program 1 times [2025-03-08 17:07:00,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:00,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774174084] [2025-03-08 17:07:00,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:00,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:00,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 17:07:00,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 17:07:00,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:00,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 17:07:01,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:01,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774174084] [2025-03-08 17:07:01,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774174084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:01,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:07:01,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:07:01,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236805161] [2025-03-08 17:07:01,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:01,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:07:01,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:01,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:07:01,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:07:01,115 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 17:07:01,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:01,159 INFO L93 Difference]: Finished difference Result 216 states and 307 transitions. [2025-03-08 17:07:01,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:07:01,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-03-08 17:07:01,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:01,161 INFO L225 Difference]: With dead ends: 216 [2025-03-08 17:07:01,161 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 17:07:01,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:07:01,162 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:01,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:07:01,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 17:07:01,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-03-08 17:07:01,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 17:07:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 155 transitions. [2025-03-08 17:07:01,168 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 155 transitions. Word has length 106 [2025-03-08 17:07:01,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:01,169 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 155 transitions. [2025-03-08 17:07:01,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 17:07:01,169 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 155 transitions. [2025-03-08 17:07:01,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 17:07:01,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:01,170 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:01,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:07:01,170 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:01,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:01,171 INFO L85 PathProgramCache]: Analyzing trace with hash 2094761483, now seen corresponding path program 1 times [2025-03-08 17:07:01,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:01,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608991503] [2025-03-08 17:07:01,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:01,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:01,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 17:07:01,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 17:07:01,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:01,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 17:07:01,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:01,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608991503] [2025-03-08 17:07:01,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608991503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:01,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:07:01,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:07:01,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557170933] [2025-03-08 17:07:01,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:01,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:07:01,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:01,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:07:01,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:07:01,325 INFO L87 Difference]: Start difference. First operand 110 states and 155 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 17:07:01,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:01,351 INFO L93 Difference]: Finished difference Result 220 states and 311 transitions. [2025-03-08 17:07:01,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:07:01,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-03-08 17:07:01,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:01,353 INFO L225 Difference]: With dead ends: 220 [2025-03-08 17:07:01,353 INFO L226 Difference]: Without dead ends: 113 [2025-03-08 17:07:01,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:07:01,354 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:01,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 434 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:07:01,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-08 17:07:01,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-03-08 17:07:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 17:07:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2025-03-08 17:07:01,359 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 106 [2025-03-08 17:07:01,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:01,360 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2025-03-08 17:07:01,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 17:07:01,360 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2025-03-08 17:07:01,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 17:07:01,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:01,361 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:01,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:07:01,361 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:01,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:01,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1312702132, now seen corresponding path program 1 times [2025-03-08 17:07:01,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:01,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481907872] [2025-03-08 17:07:01,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:01,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:01,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 17:07:01,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 17:07:01,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:01,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:01,499 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 17:07:01,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:01,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481907872] [2025-03-08 17:07:01,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481907872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:01,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:07:01,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:07:01,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981660462] [2025-03-08 17:07:01,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:01,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:07:01,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:01,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:07:01,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:07:01,503 INFO L87 Difference]: Start difference. First operand 112 states and 157 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 17:07:01,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:01,527 INFO L93 Difference]: Finished difference Result 224 states and 315 transitions. [2025-03-08 17:07:01,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:07:01,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-03-08 17:07:01,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:01,531 INFO L225 Difference]: With dead ends: 224 [2025-03-08 17:07:01,531 INFO L226 Difference]: Without dead ends: 115 [2025-03-08 17:07:01,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:07:01,534 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:01,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:07:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-08 17:07:01,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-03-08 17:07:01,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 101 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 17:07:01,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2025-03-08 17:07:01,546 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 106 [2025-03-08 17:07:01,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:01,546 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2025-03-08 17:07:01,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 17:07:01,546 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2025-03-08 17:07:01,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 17:07:01,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:01,547 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:01,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:07:01,548 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:01,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:01,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1311778611, now seen corresponding path program 1 times [2025-03-08 17:07:01,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:01,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684395965] [2025-03-08 17:07:01,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:01,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:01,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 17:07:01,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 17:07:01,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:01,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 17:07:02,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:02,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684395965] [2025-03-08 17:07:02,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684395965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:02,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:07:02,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:07:02,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790128334] [2025-03-08 17:07:02,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:02,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:07:02,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:02,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:07:02,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:07:02,371 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 17:07:02,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:02,640 INFO L93 Difference]: Finished difference Result 225 states and 315 transitions. [2025-03-08 17:07:02,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:07:02,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2025-03-08 17:07:02,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:02,642 INFO L225 Difference]: With dead ends: 225 [2025-03-08 17:07:02,642 INFO L226 Difference]: Without dead ends: 114 [2025-03-08 17:07:02,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:07:02,644 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 275 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:02,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 255 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 17:07:02,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-08 17:07:02,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-08 17:07:02,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 101 states have internal predecessors, (136), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 17:07:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 158 transitions. [2025-03-08 17:07:02,660 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 158 transitions. Word has length 106 [2025-03-08 17:07:02,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:02,660 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 158 transitions. [2025-03-08 17:07:02,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 17:07:02,661 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 158 transitions. [2025-03-08 17:07:02,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 17:07:02,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:02,662 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:02,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:07:02,662 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:02,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:02,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1186289467, now seen corresponding path program 1 times [2025-03-08 17:07:02,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:02,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846487638] [2025-03-08 17:07:02,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:02,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:02,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 17:07:02,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 17:07:02,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:02,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:02,891 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 17:07:02,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:02,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846487638] [2025-03-08 17:07:02,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846487638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:02,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:07:02,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:07:02,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010446224] [2025-03-08 17:07:02,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:02,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:07:02,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:02,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:07:02,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:07:02,894 INFO L87 Difference]: Start difference. First operand 114 states and 158 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 17:07:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:03,047 INFO L93 Difference]: Finished difference Result 227 states and 316 transitions. [2025-03-08 17:07:03,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:07:03,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2025-03-08 17:07:03,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:03,048 INFO L225 Difference]: With dead ends: 227 [2025-03-08 17:07:03,048 INFO L226 Difference]: Without dead ends: 116 [2025-03-08 17:07:03,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:07:03,049 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 3 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:03,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 477 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 17:07:03,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-08 17:07:03,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-08 17:07:03,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 17:07:03,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 160 transitions. [2025-03-08 17:07:03,056 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 160 transitions. Word has length 107 [2025-03-08 17:07:03,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:03,057 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 160 transitions. [2025-03-08 17:07:03,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 17:07:03,057 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 160 transitions. [2025-03-08 17:07:03,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 17:07:03,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:03,058 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:03,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:07:03,058 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:03,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:03,059 INFO L85 PathProgramCache]: Analyzing trace with hash 398181896, now seen corresponding path program 1 times [2025-03-08 17:07:03,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:03,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909371004] [2025-03-08 17:07:03,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:03,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:03,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 17:07:03,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 17:07:03,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:03,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:05,214 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 17:07:05,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:05,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909371004] [2025-03-08 17:07:05,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909371004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:05,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:07:05,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 17:07:05,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250278797] [2025-03-08 17:07:05,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:05,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 17:07:05,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:05,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 17:07:05,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:07:05,218 INFO L87 Difference]: Start difference. First operand 116 states and 160 transitions. Second operand has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 17:07:06,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:06,039 INFO L93 Difference]: Finished difference Result 298 states and 411 transitions. [2025-03-08 17:07:06,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:07:06,039 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 108 [2025-03-08 17:07:06,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:06,040 INFO L225 Difference]: With dead ends: 298 [2025-03-08 17:07:06,040 INFO L226 Difference]: Without dead ends: 185 [2025-03-08 17:07:06,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-03-08 17:07:06,041 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 282 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:06,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 620 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 17:07:06,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-08 17:07:06,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 137. [2025-03-08 17:07:06,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 124 states have (on average 1.3548387096774193) internal successors, (168), 124 states have internal predecessors, (168), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 17:07:06,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 190 transitions. [2025-03-08 17:07:06,050 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 190 transitions. Word has length 108 [2025-03-08 17:07:06,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:06,050 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 190 transitions. [2025-03-08 17:07:06,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 17:07:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 190 transitions. [2025-03-08 17:07:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 17:07:06,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:06,051 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:06,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:07:06,052 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:06,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:06,052 INFO L85 PathProgramCache]: Analyzing trace with hash -112352281, now seen corresponding path program 1 times [2025-03-08 17:07:06,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:06,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51046807] [2025-03-08 17:07:06,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:06,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:06,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 17:07:06,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 17:07:06,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:06,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 17:07:06,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1259776929] [2025-03-08 17:07:06,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:06,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:07:06,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:07:06,220 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:07:06,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 17:07:06,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 17:07:06,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 17:07:06,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:06,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:06,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-03-08 17:07:06,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:07:06,514 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 43 treesize of output 42 [2025-03-08 17:07:06,758 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 74 treesize of output 58 [2025-03-08 17:07:07,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:07:07,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:07:08,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 17:07:09,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 17:07:09,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 17:07:09,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:10,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:10,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:10,143 INFO L349 Elim1Store]: treesize reduction 266, result has 26.3 percent of original size [2025-03-08 17:07:10,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 75 treesize of output 169 [2025-03-08 17:07:10,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:10,397 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:07:10,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2025-03-08 17:07:10,452 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2025-03-08 17:07:10,452 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 5 case distinctions, treesize of input 141 treesize of output 151 [2025-03-08 17:07:11,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:11,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:11,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:11,065 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-03-08 17:07:11,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 51 [2025-03-08 17:07:11,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:11,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:11,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:11,179 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-03-08 17:07:11,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 51 [2025-03-08 17:07:11,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:11,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:11,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:11,385 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2025-03-08 17:07:11,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 73 [2025-03-08 17:07:11,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:11,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:11,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:11,628 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-03-08 17:07:11,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 51 [2025-03-08 17:07:11,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:11,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:11,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:11,742 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-03-08 17:07:11,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 51 [2025-03-08 17:07:12,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:12,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:12,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:07:12,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 36 [2025-03-08 17:07:12,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:12,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:12,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:12,205 INFO L349 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2025-03-08 17:07:12,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 43 [2025-03-08 17:07:12,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:12,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:12,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:12,312 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-03-08 17:07:12,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 31 [2025-03-08 17:07:15,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:15,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2025-03-08 17:07:16,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:16,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:16,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:16,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:16,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:16,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2025-03-08 17:07:16,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:16,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:16,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:16,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:16,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:16,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2025-03-08 17:07:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 68 proven. 78 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-08 17:07:16,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:07:20,807 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_831 (Array Int Int)) (v_ArrVal_829 Int) (~WrapperStruct00_var_1_16_Pointer~0.base Int) (~WrapperStruct00_var_1_16_Pointer~0.offset Int) (v_ArrVal_835 Int)) (let ((.cse0 (let ((.cse2 (store (store (store |c_#memory_int| c_~WrapperStruct00_var_1_14_Pointer~0.base v_ArrVal_832) c_~WrapperStruct00_var_1_15_Pointer~0.base v_ArrVal_831) c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select (let ((.cse3 (store |c_#memory_int| c_~WrapperStruct00_var_1_14_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset 200)))) (store .cse3 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset (select (select .cse3 ~WrapperStruct00_var_1_16_Pointer~0.base) ~WrapperStruct00_var_1_16_Pointer~0.offset)))) c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_829)))) (store .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset (mod (select (select .cse2 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) 256)))))) (or (not (= (select (select .cse0 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 0)) (let ((.cse1 (store .cse0 c_~WrapperStruct00_var_1_8_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset v_ArrVal_835)))) (< (* (select (select .cse1 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) (mod c_~last_1_WrapperStruct00_var_1_1~0 65536)) (+ (div (mod (select (select .cse1 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset) 65536) (mod (select (select .cse1 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) 256)) 1)))))) is different from false [2025-03-08 17:07:20,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:20,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51046807] [2025-03-08 17:07:20,878 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 17:07:20,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259776929] [2025-03-08 17:07:20,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259776929] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:07:20,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:07:20,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2025-03-08 17:07:20,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442360844] [2025-03-08 17:07:20,878 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 17:07:20,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 17:07:20,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:20,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 17:07:20,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=430, Unknown=2, NotChecked=42, Total=552 [2025-03-08 17:07:20,880 INFO L87 Difference]: Start difference. First operand 137 states and 190 transitions. Second operand has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 17:07:22,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:22,760 INFO L93 Difference]: Finished difference Result 570 states and 782 transitions. [2025-03-08 17:07:22,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 17:07:22,760 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 108 [2025-03-08 17:07:22,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:22,762 INFO L225 Difference]: With dead ends: 570 [2025-03-08 17:07:22,763 INFO L226 Difference]: Without dead ends: 436 [2025-03-08 17:07:22,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=207, Invalid=917, Unknown=2, NotChecked=64, Total=1190 [2025-03-08 17:07:22,764 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 1020 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:22,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 879 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 17:07:22,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-08 17:07:22,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 197. [2025-03-08 17:07:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 171 states have (on average 1.345029239766082) internal successors, (230), 171 states have internal predecessors, (230), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 17:07:22,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 274 transitions. [2025-03-08 17:07:22,780 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 274 transitions. Word has length 108 [2025-03-08 17:07:22,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:22,782 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 274 transitions. [2025-03-08 17:07:22,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 17:07:22,782 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 274 transitions. [2025-03-08 17:07:22,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 17:07:22,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:22,783 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:22,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 17:07:22,983 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,SelfDestructingSolverStorable7 [2025-03-08 17:07:22,984 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:22,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:22,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1240957416, now seen corresponding path program 1 times [2025-03-08 17:07:22,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:22,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404290898] [2025-03-08 17:07:22,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:22,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:23,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 17:07:23,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 17:07:23,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:23,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 17:07:23,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [239231112] [2025-03-08 17:07:23,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:23,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:07:23,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:07:23,050 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:07:23,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 17:07:23,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 17:07:23,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 17:07:23,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:23,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:23,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 17:07:23,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:07:23,314 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 71 treesize of output 70 [2025-03-08 17:07:23,684 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 120 treesize of output 100 [2025-03-08 17:07:24,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:24,202 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2025-03-08 17:07:24,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2025-03-08 17:07:24,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:07:24,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 17:07:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 17:07:24,284 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:07:24,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:24,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404290898] [2025-03-08 17:07:24,285 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 17:07:24,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239231112] [2025-03-08 17:07:24,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239231112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:24,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:07:24,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:07:24,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193752292] [2025-03-08 17:07:24,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:24,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:07:24,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:24,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:07:24,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:07:24,286 INFO L87 Difference]: Start difference. First operand 197 states and 274 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 17:07:30,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 17:07:31,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:31,918 INFO L93 Difference]: Finished difference Result 455 states and 633 transitions. [2025-03-08 17:07:31,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:07:31,918 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-03-08 17:07:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:31,919 INFO L225 Difference]: With dead ends: 455 [2025-03-08 17:07:31,920 INFO L226 Difference]: Without dead ends: 310 [2025-03-08 17:07:31,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:07:31,920 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 182 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:31,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 645 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 449 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2025-03-08 17:07:31,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-08 17:07:31,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 208. [2025-03-08 17:07:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.3314917127071824) internal successors, (241), 181 states have internal predecessors, (241), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 17:07:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 285 transitions. [2025-03-08 17:07:31,941 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 285 transitions. Word has length 108 [2025-03-08 17:07:31,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:31,941 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 285 transitions. [2025-03-08 17:07:31,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 17:07:31,941 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 285 transitions. [2025-03-08 17:07:31,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 17:07:31,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:31,942 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:31,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 17:07:32,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:07:32,143 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:32,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:32,143 INFO L85 PathProgramCache]: Analyzing trace with hash 598899017, now seen corresponding path program 1 times [2025-03-08 17:07:32,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:32,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186046032] [2025-03-08 17:07:32,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:32,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:32,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 17:07:32,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 17:07:32,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:32,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 17:07:32,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:32,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186046032] [2025-03-08 17:07:32,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186046032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:32,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:07:32,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:07:32,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979033491] [2025-03-08 17:07:32,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:32,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:07:32,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:32,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:07:32,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:07:32,926 INFO L87 Difference]: Start difference. First operand 208 states and 285 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 17:07:33,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:33,410 INFO L93 Difference]: Finished difference Result 346 states and 475 transitions. [2025-03-08 17:07:33,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:07:33,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 108 [2025-03-08 17:07:33,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:33,411 INFO L225 Difference]: With dead ends: 346 [2025-03-08 17:07:33,411 INFO L226 Difference]: Without dead ends: 212 [2025-03-08 17:07:33,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:07:33,412 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 182 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:33,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 414 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 17:07:33,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-08 17:07:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2025-03-08 17:07:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 184 states have (on average 1.315217391304348) internal successors, (242), 184 states have internal predecessors, (242), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 17:07:33,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 286 transitions. [2025-03-08 17:07:33,431 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 286 transitions. Word has length 108 [2025-03-08 17:07:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:33,431 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 286 transitions. [2025-03-08 17:07:33,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 17:07:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 286 transitions. [2025-03-08 17:07:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 17:07:33,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:33,432 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:33,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:07:33,432 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:33,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:33,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1934059113, now seen corresponding path program 1 times [2025-03-08 17:07:33,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:33,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399384572] [2025-03-08 17:07:33,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:33,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:33,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 17:07:33,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 17:07:33,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:33,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:00,355 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 17:08:00,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:00,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399384572] [2025-03-08 17:08:00,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399384572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:00,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:00,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 17:08:00,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983322452] [2025-03-08 17:08:00,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:00,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 17:08:00,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:00,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 17:08:00,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:08:00,357 INFO L87 Difference]: Start difference. First operand 212 states and 286 transitions. Second operand has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 13 states have internal predecessors, (56), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-08 17:08:01,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:01,963 INFO L93 Difference]: Finished difference Result 437 states and 592 transitions. [2025-03-08 17:08:01,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 17:08:01,964 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 13 states have internal predecessors, (56), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 5 states have call successors, (11) Word has length 108 [2025-03-08 17:08:01,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:01,965 INFO L225 Difference]: With dead ends: 437 [2025-03-08 17:08:01,965 INFO L226 Difference]: Without dead ends: 299 [2025-03-08 17:08:01,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-03-08 17:08:01,966 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 571 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:01,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 814 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 17:08:01,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-08 17:08:01,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 230. [2025-03-08 17:08:01,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 202 states have (on average 1.3267326732673268) internal successors, (268), 202 states have internal predecessors, (268), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 17:08:01,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 312 transitions. [2025-03-08 17:08:01,989 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 312 transitions. Word has length 108 [2025-03-08 17:08:01,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:01,990 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 312 transitions. [2025-03-08 17:08:01,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 13 states have internal predecessors, (56), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-08 17:08:01,990 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 312 transitions. [2025-03-08 17:08:01,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 17:08:01,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:01,991 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:01,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:08:01,991 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:01,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:01,992 INFO L85 PathProgramCache]: Analyzing trace with hash 836547048, now seen corresponding path program 1 times [2025-03-08 17:08:01,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:01,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396880526] [2025-03-08 17:08:01,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:01,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:02,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 17:08:02,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 17:08:02,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:02,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 17:08:02,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [299081443] [2025-03-08 17:08:02,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:02,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:08:02,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:08:02,046 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:08:02,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 17:08:02,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 17:08:02,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 17:08:02,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:02,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:02,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-03-08 17:08:02,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:08:03,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:08:03,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:08:04,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:08:04,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:08:04,703 INFO L349 Elim1Store]: treesize reduction 254, result has 27.2 percent of original size [2025-03-08 17:08:04,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 149 [2025-03-08 17:08:04,962 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 34 treesize of output 22 [2025-03-08 17:08:04,966 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:08:04,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-08 17:08:05,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:08:05,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2025-03-08 17:08:05,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:08:05,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2025-03-08 17:08:05,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:08:05,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2025-03-08 17:08:05,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:08:05,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2025-03-08 17:08:05,256 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-03-08 17:08:05,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 34 [2025-03-08 17:08:05,284 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-03-08 17:08:05,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2025-03-08 17:08:05,302 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 17:08:05,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 21 [2025-03-08 17:08:05,402 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 17:08:05,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 21 [2025-03-08 17:08:05,469 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 17:08:05,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 21 [2025-03-08 17:08:05,497 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:08:05,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2025-03-08 17:08:05,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:05,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:05,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2025-03-08 17:08:06,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:06,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:06,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:06,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:06,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:06,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:06,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:06,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2025-03-08 17:08:06,434 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-08 17:08:06,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:08:10,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:10,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396880526] [2025-03-08 17:08:10,944 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 17:08:10,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299081443] [2025-03-08 17:08:10,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299081443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:08:10,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:08:10,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-08 17:08:10,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972916677] [2025-03-08 17:08:10,944 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 17:08:10,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 17:08:10,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:10,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 17:08:10,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-03-08 17:08:10,946 INFO L87 Difference]: Start difference. First operand 230 states and 312 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 17:08:12,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:12,616 INFO L93 Difference]: Finished difference Result 526 states and 717 transitions. [2025-03-08 17:08:12,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 17:08:12,617 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-03-08 17:08:12,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:12,618 INFO L225 Difference]: With dead ends: 526 [2025-03-08 17:08:12,618 INFO L226 Difference]: Without dead ends: 369 [2025-03-08 17:08:12,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2025-03-08 17:08:12,620 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 569 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:12,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 722 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 17:08:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-08 17:08:12,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 244. [2025-03-08 17:08:12,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 216 states have (on average 1.3333333333333333) internal successors, (288), 216 states have internal predecessors, (288), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 17:08:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 332 transitions. [2025-03-08 17:08:12,660 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 332 transitions. Word has length 108 [2025-03-08 17:08:12,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:12,660 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 332 transitions. [2025-03-08 17:08:12,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 17:08:12,660 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 332 transitions. [2025-03-08 17:08:12,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 17:08:12,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:12,661 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:12,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 17:08:12,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:08:12,862 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:12,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:12,862 INFO L85 PathProgramCache]: Analyzing trace with hash 326012871, now seen corresponding path program 1 times [2025-03-08 17:08:12,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:12,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435220764] [2025-03-08 17:08:12,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:12,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:12,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 17:08:12,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 17:08:12,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:12,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:13,347 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 17:08:13,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:13,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435220764] [2025-03-08 17:08:13,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435220764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:13,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:13,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 17:08:13,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280867986] [2025-03-08 17:08:13,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:13,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:08:13,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:13,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:08:13,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:08:13,351 INFO L87 Difference]: Start difference. First operand 244 states and 332 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 17:08:13,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:13,769 INFO L93 Difference]: Finished difference Result 484 states and 660 transitions. [2025-03-08 17:08:13,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:08:13,770 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-03-08 17:08:13,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:13,771 INFO L225 Difference]: With dead ends: 484 [2025-03-08 17:08:13,771 INFO L226 Difference]: Without dead ends: 313 [2025-03-08 17:08:13,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-08 17:08:13,774 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 284 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:13,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 726 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 17:08:13,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-08 17:08:13,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 262. [2025-03-08 17:08:13,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 234 states have (on average 1.3418803418803418) internal successors, (314), 234 states have internal predecessors, (314), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 17:08:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 358 transitions. [2025-03-08 17:08:13,806 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 358 transitions. Word has length 108 [2025-03-08 17:08:13,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:13,807 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 358 transitions. [2025-03-08 17:08:13,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 17:08:13,807 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 358 transitions. [2025-03-08 17:08:13,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 17:08:13,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:13,809 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:13,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 17:08:13,809 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:13,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:13,809 INFO L85 PathProgramCache]: Analyzing trace with hash -2105110551, now seen corresponding path program 1 times [2025-03-08 17:08:13,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:13,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587593391] [2025-03-08 17:08:13,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:13,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:13,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 17:08:13,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 17:08:13,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:13,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:15,991 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 17:08:15,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:15,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587593391] [2025-03-08 17:08:15,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587593391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:15,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:15,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 17:08:15,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787179322] [2025-03-08 17:08:15,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:15,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 17:08:15,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:15,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 17:08:15,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:08:15,993 INFO L87 Difference]: Start difference. First operand 262 states and 358 transitions. Second operand has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 13 states have internal predecessors, (56), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-08 17:08:17,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:17,474 INFO L93 Difference]: Finished difference Result 518 states and 710 transitions. [2025-03-08 17:08:17,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 17:08:17,475 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 13 states have internal predecessors, (56), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 5 states have call successors, (11) Word has length 108 [2025-03-08 17:08:17,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:17,477 INFO L225 Difference]: With dead ends: 518 [2025-03-08 17:08:17,477 INFO L226 Difference]: Without dead ends: 329 [2025-03-08 17:08:17,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-03-08 17:08:17,478 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 396 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:17,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 893 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 17:08:17,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-08 17:08:17,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 274. [2025-03-08 17:08:17,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 246 states have (on average 1.3495934959349594) internal successors, (332), 246 states have internal predecessors, (332), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 17:08:17,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 376 transitions. [2025-03-08 17:08:17,519 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 376 transitions. Word has length 108 [2025-03-08 17:08:17,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:17,519 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 376 transitions. [2025-03-08 17:08:17,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 13 states have internal predecessors, (56), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-08 17:08:17,519 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 376 transitions. [2025-03-08 17:08:17,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 17:08:17,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:17,520 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:17,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 17:08:17,520 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:17,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:17,522 INFO L85 PathProgramCache]: Analyzing trace with hash 233092248, now seen corresponding path program 1 times [2025-03-08 17:08:17,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:17,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225275120] [2025-03-08 17:08:17,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:17,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:17,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 17:08:17,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 17:08:17,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:17,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 17:08:17,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1476057794] [2025-03-08 17:08:17,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:17,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:08:17,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:08:17,585 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:08:17,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 17:08:17,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 17:08:17,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 17:08:17,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:17,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:17,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-08 17:08:17,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:08:20,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:08:20,570 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 28 treesize of output 23 [2025-03-08 17:08:20,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:20,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:20,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:20,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:20,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:20,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:20,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2025-03-08 17:08:20,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:20,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:20,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:20,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:20,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:20,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:20,829 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2025-03-08 17:08:20,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 68 [2025-03-08 17:08:21,311 INFO L349 Elim1Store]: treesize reduction 152, result has 24.8 percent of original size [2025-03-08 17:08:21,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 97 treesize of output 119