./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-59.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 b230d83c95de2b0a2d65b5c62bdacb0eaf62e204b83623e9d22dd193a3762a9e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:10:43,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:10:43,920 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:10:43,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:10:43,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:10:43,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:10:43,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:10:43,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:10:43,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:10:43,948 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:10:43,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:10:43,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:10:43,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:10:43,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:10:43,948 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:10:43,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:10:43,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:10:43,948 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:10:43,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:10:43,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:10:43,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:10:43,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:10:43,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:10:43,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:10:43,949 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:10:43,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:10:43,949 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:10:43,949 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:10:43,949 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:10:43,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:10:43,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:10:43,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:10:43,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:10:43,949 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:10:43,949 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:10:43,949 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:10:43,949 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:10:43,949 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:10:43,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:10:43,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:10:43,949 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:10:43,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:10:43,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:10:43,949 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 -> b230d83c95de2b0a2d65b5c62bdacb0eaf62e204b83623e9d22dd193a3762a9e [2025-03-17 06:10:44,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:10:44,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:10:44,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:10:44,213 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:10:44,213 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:10:44,215 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-59.i [2025-03-17 06:10:45,485 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/004e3c0f3/1e5e7f3871244fb6a1c85d49f21d8141/FLAG9280db2df [2025-03-17 06:10:45,725 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:10:45,726 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-59.i [2025-03-17 06:10:45,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/004e3c0f3/1e5e7f3871244fb6a1c85d49f21d8141/FLAG9280db2df [2025-03-17 06:10:46,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/004e3c0f3/1e5e7f3871244fb6a1c85d49f21d8141 [2025-03-17 06:10:46,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:10:46,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:10:46,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:10:46,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:10:46,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:10:46,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:10:46" (1/1) ... [2025-03-17 06:10:46,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@223692e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:10:46, skipping insertion in model container [2025-03-17 06:10:46,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:10:46" (1/1) ... [2025-03-17 06:10:46,075 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:10:46,162 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-59.i[917,930] [2025-03-17 06:10:46,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:10:46,201 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:10:46,208 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-59.i[917,930] [2025-03-17 06:10:46,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:10:46,249 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:10:46,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:10:46 WrapperNode [2025-03-17 06:10:46,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:10:46,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:10:46,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:10:46,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:10:46,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:10:46" (1/1) ... [2025-03-17 06:10:46,263 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:10:46" (1/1) ... [2025-03-17 06:10:46,288 INFO L138 Inliner]: procedures = 27, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 354 [2025-03-17 06:10:46,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:10:46,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:10:46,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:10:46,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:10:46,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:10:46" (1/1) ... [2025-03-17 06:10:46,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:10:46" (1/1) ... [2025-03-17 06:10:46,298 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:10:46" (1/1) ... [2025-03-17 06:10:46,317 INFO L175 MemorySlicer]: Split 97 memory accesses to 2 slices as follows [2, 95]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2025-03-17 06:10:46,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:10:46" (1/1) ... [2025-03-17 06:10:46,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:10:46" (1/1) ... [2025-03-17 06:10:46,324 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:10:46" (1/1) ... [2025-03-17 06:10:46,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:10:46" (1/1) ... [2025-03-17 06:10:46,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:10:46" (1/1) ... [2025-03-17 06:10:46,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:10:46" (1/1) ... [2025-03-17 06:10:46,329 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:10:46,330 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:10:46,330 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:10:46,330 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:10:46,331 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:10:46" (1/1) ... [2025-03-17 06:10:46,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:10:46,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:10:46,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:10:46,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:10:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:10:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 06:10:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 06:10:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 06:10:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 06:10:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 06:10:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 06:10:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:10:46,384 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:10:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:10:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 06:10:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:10:46,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:10:46,479 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:10:46,480 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:10:46,775 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L128: havoc property_#t~mem55#1;havoc property_#t~ite57#1;havoc property_#t~mem56#1;havoc property_#t~ite65#1;havoc property_#t~mem61#1;havoc property_#t~mem58#1;havoc property_#t~mem59#1;havoc property_#t~mem60#1;havoc property_#t~mem64#1;havoc property_#t~mem62#1;havoc property_#t~mem63#1;havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite78#1;havoc property_#t~mem68#1;havoc property_#t~ite75#1;havoc property_#t~mem72#1;havoc property_#t~mem69#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem74#1;havoc property_#t~mem73#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~short79#1;havoc property_#t~ite89#1;havoc property_#t~mem82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~short85#1;havoc property_#t~ite88#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~short90#1; [2025-03-17 06:10:46,808 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2025-03-17 06:10:46,808 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:10:46,820 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:10:46,820 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:10:46,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:10:46 BoogieIcfgContainer [2025-03-17 06:10:46,820 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:10:46,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:10:46,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:10:46,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:10:46,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:10:46" (1/3) ... [2025-03-17 06:10:46,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b44a4bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:10:46, skipping insertion in model container [2025-03-17 06:10:46,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:10:46" (2/3) ... [2025-03-17 06:10:46,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b44a4bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:10:46, skipping insertion in model container [2025-03-17 06:10:46,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:10:46" (3/3) ... [2025-03-17 06:10:46,828 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-59.i [2025-03-17 06:10:46,841 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:10:46,843 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-59.i that has 2 procedures, 78 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:10:46,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:10:46,902 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;@1de76982, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:10:46,902 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:10:46,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:10:46,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 06:10:46,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:10:46,921 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:10:46,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:10:46,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:10:46,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1204309454, now seen corresponding path program 1 times [2025-03-17 06:10:46,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:10:46,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577395332] [2025-03-17 06:10:46,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:10:46,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:10:47,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 06:10:47,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 06:10:47,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:10:47,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:10:48,298 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:10:48,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:10:48,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577395332] [2025-03-17 06:10:48,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577395332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:10:48,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:10:48,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:10:48,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996848681] [2025-03-17 06:10:48,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:10:48,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:10:48,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:10:48,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:10:48,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:10:48,328 INFO L87 Difference]: Start difference. First operand has 78 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:10:48,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:10:48,682 INFO L93 Difference]: Finished difference Result 229 states and 379 transitions. [2025-03-17 06:10:48,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:10:48,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2025-03-17 06:10:48,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:10:48,694 INFO L225 Difference]: With dead ends: 229 [2025-03-17 06:10:48,694 INFO L226 Difference]: Without dead ends: 152 [2025-03-17 06:10:48,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:10:48,700 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 72 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:10:48,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 229 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:10:48,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-17 06:10:48,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 142. [2025-03-17 06:10:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 103 states have (on average 1.3203883495145632) internal successors, (136), 103 states have internal predecessors, (136), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 06:10:48,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 208 transitions. [2025-03-17 06:10:48,768 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 208 transitions. Word has length 127 [2025-03-17 06:10:48,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:10:48,769 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 208 transitions. [2025-03-17 06:10:48,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:10:48,770 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 208 transitions. [2025-03-17 06:10:48,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 06:10:48,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:10:48,775 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:10:48,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:10:48,775 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:10:48,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:10:48,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2010154036, now seen corresponding path program 1 times [2025-03-17 06:10:48,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:10:48,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285055462] [2025-03-17 06:10:48,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:10:48,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:10:48,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 06:10:48,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 06:10:48,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:10:48,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:10:50,156 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:10:50,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:10:50,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285055462] [2025-03-17 06:10:50,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285055462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:10:50,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:10:50,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:10:50,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497588913] [2025-03-17 06:10:50,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:10:50,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:10:50,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:10:50,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:10:50,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:10:50,163 INFO L87 Difference]: Start difference. First operand 142 states and 208 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 06:10:50,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:10:50,459 INFO L93 Difference]: Finished difference Result 233 states and 343 transitions. [2025-03-17 06:10:50,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:10:50,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 129 [2025-03-17 06:10:50,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:10:50,461 INFO L225 Difference]: With dead ends: 233 [2025-03-17 06:10:50,461 INFO L226 Difference]: Without dead ends: 142 [2025-03-17 06:10:50,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:10:50,462 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 50 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:10:50,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 221 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:10:50,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-17 06:10:50,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-17 06:10:50,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 06:10:50,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 207 transitions. [2025-03-17 06:10:50,501 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 207 transitions. Word has length 129 [2025-03-17 06:10:50,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:10:50,501 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 207 transitions. [2025-03-17 06:10:50,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 06:10:50,502 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 207 transitions. [2025-03-17 06:10:50,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 06:10:50,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:10:50,505 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:10:50,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:10:50,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:10:50,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:10:50,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1716751029, now seen corresponding path program 1 times [2025-03-17 06:10:50,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:10:50,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766180325] [2025-03-17 06:10:50,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:10:50,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:10:50,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 06:10:50,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 06:10:50,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:10:50,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:10:50,952 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:10:50,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:10:50,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766180325] [2025-03-17 06:10:50,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766180325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:10:50,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:10:50,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:10:50,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255038477] [2025-03-17 06:10:50,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:10:50,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:10:50,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:10:50,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:10:50,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:10:50,956 INFO L87 Difference]: Start difference. First operand 142 states and 207 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:10:51,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:10:51,281 INFO L93 Difference]: Finished difference Result 256 states and 374 transitions. [2025-03-17 06:10:51,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:10:51,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2025-03-17 06:10:51,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:10:51,284 INFO L225 Difference]: With dead ends: 256 [2025-03-17 06:10:51,284 INFO L226 Difference]: Without dead ends: 168 [2025-03-17 06:10:51,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:10:51,285 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 165 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:10:51,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 195 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:10:51,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-17 06:10:51,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 145. [2025-03-17 06:10:51,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 106 states have (on average 1.3018867924528301) internal successors, (138), 106 states have internal predecessors, (138), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 06:10:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 210 transitions. [2025-03-17 06:10:51,314 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 210 transitions. Word has length 129 [2025-03-17 06:10:51,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:10:51,315 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 210 transitions. [2025-03-17 06:10:51,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:10:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 210 transitions. [2025-03-17 06:10:51,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 06:10:51,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:10:51,316 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:10:51,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:10:51,316 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:10:51,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:10:51,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1520237524, now seen corresponding path program 1 times [2025-03-17 06:10:51,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:10:51,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91802320] [2025-03-17 06:10:51,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:10:51,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:10:51,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 06:10:51,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 06:10:51,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:10:51,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:10:54,015 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:10:54,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:10:54,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91802320] [2025-03-17 06:10:54,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91802320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:10:54,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:10:54,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:10:54,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586524633] [2025-03-17 06:10:54,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:10:54,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:10:54,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:10:54,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:10:54,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:10:54,019 INFO L87 Difference]: Start difference. First operand 145 states and 210 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 06:10:54,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:10:54,779 INFO L93 Difference]: Finished difference Result 353 states and 512 transitions. [2025-03-17 06:10:54,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:10:54,780 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 129 [2025-03-17 06:10:54,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:10:54,782 INFO L225 Difference]: With dead ends: 353 [2025-03-17 06:10:54,782 INFO L226 Difference]: Without dead ends: 269 [2025-03-17 06:10:54,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:10:54,783 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 224 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:10:54,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 475 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:10:54,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-17 06:10:54,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 231. [2025-03-17 06:10:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 173 states have (on average 1.3121387283236994) internal successors, (227), 173 states have internal predecessors, (227), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 06:10:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 335 transitions. [2025-03-17 06:10:54,814 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 335 transitions. Word has length 129 [2025-03-17 06:10:54,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:10:54,814 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 335 transitions. [2025-03-17 06:10:54,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 06:10:54,814 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 335 transitions. [2025-03-17 06:10:54,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 06:10:54,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:10:54,815 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:10:54,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:10:54,816 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:10:54,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:10:54,816 INFO L85 PathProgramCache]: Analyzing trace with hash -287216939, now seen corresponding path program 1 times [2025-03-17 06:10:54,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:10:54,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960239696] [2025-03-17 06:10:54,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:10:54,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:10:54,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 06:10:54,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 06:10:54,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:10:54,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:10:55,037 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:10:55,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:10:55,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960239696] [2025-03-17 06:10:55,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960239696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:10:55,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:10:55,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:10:55,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807220447] [2025-03-17 06:10:55,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:10:55,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:10:55,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:10:55,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:10:55,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:10:55,039 INFO L87 Difference]: Start difference. First operand 231 states and 335 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:10:55,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:10:55,255 INFO L93 Difference]: Finished difference Result 448 states and 650 transitions. [2025-03-17 06:10:55,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:10:55,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2025-03-17 06:10:55,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:10:55,258 INFO L225 Difference]: With dead ends: 448 [2025-03-17 06:10:55,258 INFO L226 Difference]: Without dead ends: 277 [2025-03-17 06:10:55,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:10:55,259 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 70 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:10:55,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 286 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:10:55,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-17 06:10:55,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 243. [2025-03-17 06:10:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 185 states have (on average 1.3135135135135134) internal successors, (243), 185 states have internal predecessors, (243), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 06:10:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 351 transitions. [2025-03-17 06:10:55,302 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 351 transitions. Word has length 129 [2025-03-17 06:10:55,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:10:55,303 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 351 transitions. [2025-03-17 06:10:55,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:10:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 351 transitions. [2025-03-17 06:10:55,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 06:10:55,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:10:55,304 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:10:55,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:10:55,304 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:10:55,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:10:55,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1649320243, now seen corresponding path program 1 times [2025-03-17 06:10:55,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:10:55,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254484203] [2025-03-17 06:10:55,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:10:55,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:10:55,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 06:10:55,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 06:10:55,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:10:55,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:10:55,519 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:10:55,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:10:55,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254484203] [2025-03-17 06:10:55,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254484203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:10:55,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:10:55,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:10:55,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831673819] [2025-03-17 06:10:55,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:10:55,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:10:55,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:10:55,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:10:55,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:10:55,522 INFO L87 Difference]: Start difference. First operand 243 states and 351 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:10:55,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:10:55,743 INFO L93 Difference]: Finished difference Result 458 states and 662 transitions. [2025-03-17 06:10:55,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:10:55,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2025-03-17 06:10:55,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:10:55,745 INFO L225 Difference]: With dead ends: 458 [2025-03-17 06:10:55,745 INFO L226 Difference]: Without dead ends: 272 [2025-03-17 06:10:55,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:10:55,746 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 73 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:10:55,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 285 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:10:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-17 06:10:55,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 238. [2025-03-17 06:10:55,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 180 states have (on average 1.3055555555555556) internal successors, (235), 180 states have internal predecessors, (235), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 06:10:55,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 343 transitions. [2025-03-17 06:10:55,779 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 343 transitions. Word has length 129 [2025-03-17 06:10:55,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:10:55,780 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 343 transitions. [2025-03-17 06:10:55,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:10:55,780 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 343 transitions. [2025-03-17 06:10:55,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 06:10:55,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:10:55,781 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:10:55,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:10:55,782 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:10:55,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:10:55,782 INFO L85 PathProgramCache]: Analyzing trace with hash -2065429010, now seen corresponding path program 1 times [2025-03-17 06:10:55,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:10:55,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348963562] [2025-03-17 06:10:55,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:10:55,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:10:55,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 06:10:55,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 06:10:55,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:10:55,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:10:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:10:56,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:10:56,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348963562] [2025-03-17 06:10:56,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348963562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:10:56,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:10:56,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:10:56,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128364658] [2025-03-17 06:10:56,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:10:56,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:10:56,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:10:56,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:10:56,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:10:56,262 INFO L87 Difference]: Start difference. First operand 238 states and 343 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:10:56,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:10:56,511 INFO L93 Difference]: Finished difference Result 510 states and 733 transitions. [2025-03-17 06:10:56,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:10:56,512 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2025-03-17 06:10:56,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:10:56,514 INFO L225 Difference]: With dead ends: 510 [2025-03-17 06:10:56,514 INFO L226 Difference]: Without dead ends: 339 [2025-03-17 06:10:56,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:10:56,515 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 169 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:10:56,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 392 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:10:56,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-03-17 06:10:56,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 294. [2025-03-17 06:10:56,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 236 states have (on average 1.3135593220338984) internal successors, (310), 236 states have internal predecessors, (310), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 06:10:56,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 418 transitions. [2025-03-17 06:10:56,554 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 418 transitions. Word has length 131 [2025-03-17 06:10:56,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:10:56,554 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 418 transitions. [2025-03-17 06:10:56,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:10:56,554 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 418 transitions. [2025-03-17 06:10:56,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 06:10:56,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:10:56,556 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:10:56,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:10:56,556 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:10:56,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:10:56,557 INFO L85 PathProgramCache]: Analyzing trace with hash -893053156, now seen corresponding path program 1 times [2025-03-17 06:10:56,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:10:56,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976584274] [2025-03-17 06:10:56,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:10:56,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:10:56,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 06:10:56,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 06:10:56,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:10:56,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 06:10:56,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [379237325] [2025-03-17 06:10:56,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:10:56,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:10:56,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:10:56,797 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:10:56,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:10:56,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 06:10:56,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 06:10:56,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:10:56,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:10:56,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 06:10:57,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:10:57,065 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-17 06:10:57,165 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 110 treesize of output 80 [2025-03-17 06:11:00,039 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 30 treesize of output 21 [2025-03-17 06:11:00,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:00,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:00,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:00,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:00,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:11:00,161 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 3 case distinctions, treesize of input 42 treesize of output 47 [2025-03-17 06:11:00,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:00,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:00,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:00,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:00,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:11:00,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 21 [2025-03-17 06:11:00,413 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:11:00,413 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:11:00,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:00,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976584274] [2025-03-17 06:11:00,414 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 06:11:00,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379237325] [2025-03-17 06:11:00,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379237325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:00,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:11:00,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:11:00,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354291868] [2025-03-17 06:11:00,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:00,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:11:00,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:00,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:11:00,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:11:00,418 INFO L87 Difference]: Start difference. First operand 294 states and 418 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:01,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:01,684 INFO L93 Difference]: Finished difference Result 545 states and 773 transitions. [2025-03-17 06:11:01,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:11:01,685 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 132 [2025-03-17 06:11:01,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:01,687 INFO L225 Difference]: With dead ends: 545 [2025-03-17 06:11:01,687 INFO L226 Difference]: Without dead ends: 323 [2025-03-17 06:11:01,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:11:01,689 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 110 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 48 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:01,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 413 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 470 Invalid, 1 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 06:11:01,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-17 06:11:01,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 294. [2025-03-17 06:11:01,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 236 states have (on average 1.3093220338983051) internal successors, (309), 236 states have internal predecessors, (309), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 06:11:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 417 transitions. [2025-03-17 06:11:01,725 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 417 transitions. Word has length 132 [2025-03-17 06:11:01,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:01,726 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 417 transitions. [2025-03-17 06:11:01,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 417 transitions. [2025-03-17 06:11:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 06:11:01,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:01,727 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:01,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 06:11:01,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:01,933 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:01,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:01,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1655581168, now seen corresponding path program 1 times [2025-03-17 06:11:01,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:01,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311202499] [2025-03-17 06:11:01,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:01,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:01,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 06:11:02,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 06:11:02,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:02,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 06:11:02,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [75744250] [2025-03-17 06:11:02,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:02,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:02,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:02,118 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:11:02,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:11:02,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 06:11:02,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 06:11:02,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:02,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:02,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 06:11:02,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:02,301 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-17 06:11:02,394 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 110 treesize of output 80 [2025-03-17 06:11:04,864 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 30 treesize of output 21 [2025-03-17 06:11:05,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:05,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:05,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:05,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:05,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:11:05,021 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 3 case distinctions, treesize of input 42 treesize of output 47 [2025-03-17 06:11:05,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:05,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:05,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:05,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:05,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:11:05,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 26 [2025-03-17 06:11:05,238 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:11:05,238 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:11:05,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:05,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311202499] [2025-03-17 06:11:05,239 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 06:11:05,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75744250] [2025-03-17 06:11:05,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75744250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:05,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:11:05,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:11:05,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721117558] [2025-03-17 06:11:05,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:05,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:11:05,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:05,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:11:05,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:11:05,240 INFO L87 Difference]: Start difference. First operand 294 states and 417 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:07,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:07,072 INFO L93 Difference]: Finished difference Result 542 states and 768 transitions. [2025-03-17 06:11:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:11:07,073 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 133 [2025-03-17 06:11:07,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:07,075 INFO L225 Difference]: With dead ends: 542 [2025-03-17 06:11:07,076 INFO L226 Difference]: Without dead ends: 318 [2025-03-17 06:11:07,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:11:07,078 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 102 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:07,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 356 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 06:11:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-17 06:11:07,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 294. [2025-03-17 06:11:07,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 236 states have (on average 1.305084745762712) internal successors, (308), 236 states have internal predecessors, (308), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 06:11:07,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 416 transitions. [2025-03-17 06:11:07,109 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 416 transitions. Word has length 133 [2025-03-17 06:11:07,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:07,110 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 416 transitions. [2025-03-17 06:11:07,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:07,111 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 416 transitions. [2025-03-17 06:11:07,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 06:11:07,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:07,111 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:07,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 06:11:07,312 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,SelfDestructingSolverStorable8 [2025-03-17 06:11:07,312 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:07,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:07,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1267621986, now seen corresponding path program 1 times [2025-03-17 06:11:07,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:07,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150124942] [2025-03-17 06:11:07,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:07,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:07,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 06:11:07,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 06:11:07,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:07,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:11:09,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:09,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150124942] [2025-03-17 06:11:09,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150124942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:09,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:11:09,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:11:09,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179995920] [2025-03-17 06:11:09,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:09,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:11:09,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:09,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:11:09,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:11:09,656 INFO L87 Difference]: Start difference. First operand 294 states and 416 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:11:10,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:10,448 INFO L93 Difference]: Finished difference Result 613 states and 870 transitions. [2025-03-17 06:11:10,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:11:10,449 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 134 [2025-03-17 06:11:10,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:10,451 INFO L225 Difference]: With dead ends: 613 [2025-03-17 06:11:10,452 INFO L226 Difference]: Without dead ends: 398 [2025-03-17 06:11:10,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:11:10,454 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 178 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:10,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 495 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:11:10,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-17 06:11:10,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 347. [2025-03-17 06:11:10,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 289 states have (on average 1.3217993079584776) internal successors, (382), 289 states have internal predecessors, (382), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 06:11:10,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 490 transitions. [2025-03-17 06:11:10,497 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 490 transitions. Word has length 134 [2025-03-17 06:11:10,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:10,497 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 490 transitions. [2025-03-17 06:11:10,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:11:10,498 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 490 transitions. [2025-03-17 06:11:10,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 06:11:10,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:10,499 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:10,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:11:10,499 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:10,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:10,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1219890847, now seen corresponding path program 1 times [2025-03-17 06:11:10,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:10,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543548294] [2025-03-17 06:11:10,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:10,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:10,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 06:11:10,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 06:11:10,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:10,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:11,253 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:11:11,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:11,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543548294] [2025-03-17 06:11:11,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543548294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:11,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:11:11,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:11:11,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911432119] [2025-03-17 06:11:11,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:11,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:11:11,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:11,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:11:11,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:11:11,255 INFO L87 Difference]: Start difference. First operand 347 states and 490 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 06:11:11,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:11,736 INFO L93 Difference]: Finished difference Result 657 states and 933 transitions. [2025-03-17 06:11:11,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:11:11,736 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 134 [2025-03-17 06:11:11,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:11,738 INFO L225 Difference]: With dead ends: 657 [2025-03-17 06:11:11,738 INFO L226 Difference]: Without dead ends: 392 [2025-03-17 06:11:11,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:11:11,739 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 146 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:11,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 336 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:11:11,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-17 06:11:11,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 347. [2025-03-17 06:11:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 289 states have (on average 1.3114186851211074) internal successors, (379), 289 states have internal predecessors, (379), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 06:11:11,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 487 transitions. [2025-03-17 06:11:11,772 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 487 transitions. Word has length 134 [2025-03-17 06:11:11,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:11,772 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 487 transitions. [2025-03-17 06:11:11,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 06:11:11,772 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 487 transitions. [2025-03-17 06:11:11,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 06:11:11,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:11,773 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:11,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:11:11,773 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:11,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:11,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2112093857, now seen corresponding path program 1 times [2025-03-17 06:11:11,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:11,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749022963] [2025-03-17 06:11:11,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:11,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:11,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 06:11:11,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 06:11:11,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:11,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:11:12,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:12,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749022963] [2025-03-17 06:11:12,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749022963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:12,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:11:12,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:11:12,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798801137] [2025-03-17 06:11:12,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:12,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:11:12,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:12,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:11:12,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:11:12,384 INFO L87 Difference]: Start difference. First operand 347 states and 487 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 06:11:12,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:12,795 INFO L93 Difference]: Finished difference Result 652 states and 925 transitions. [2025-03-17 06:11:12,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:11:12,796 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 134 [2025-03-17 06:11:12,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:12,798 INFO L225 Difference]: With dead ends: 652 [2025-03-17 06:11:12,798 INFO L226 Difference]: Without dead ends: 387 [2025-03-17 06:11:12,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:11:12,800 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 270 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:12,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 286 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:11:12,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-17 06:11:12,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 349. [2025-03-17 06:11:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 291 states have (on average 1.3058419243986255) internal successors, (380), 291 states have internal predecessors, (380), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 06:11:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 488 transitions. [2025-03-17 06:11:12,834 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 488 transitions. Word has length 134 [2025-03-17 06:11:12,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:12,834 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 488 transitions. [2025-03-17 06:11:12,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 06:11:12,835 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 488 transitions. [2025-03-17 06:11:12,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 06:11:12,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:12,835 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:12,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 06:11:12,835 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:12,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:12,836 INFO L85 PathProgramCache]: Analyzing trace with hash 375418976, now seen corresponding path program 1 times [2025-03-17 06:11:12,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:12,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639705533] [2025-03-17 06:11:12,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:12,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:12,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 06:11:12,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 06:11:12,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:12,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:11:13,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:13,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639705533] [2025-03-17 06:11:13,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639705533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:13,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:11:13,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:11:13,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553296663] [2025-03-17 06:11:13,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:13,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:11:13,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:13,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:11:13,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:11:13,142 INFO L87 Difference]: Start difference. First operand 349 states and 488 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:13,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:13,429 INFO L93 Difference]: Finished difference Result 652 states and 921 transitions. [2025-03-17 06:11:13,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:11:13,429 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134 [2025-03-17 06:11:13,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:13,432 INFO L225 Difference]: With dead ends: 652 [2025-03-17 06:11:13,432 INFO L226 Difference]: Without dead ends: 393 [2025-03-17 06:11:13,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:11:13,437 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 136 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:13,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 589 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:11:13,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-17 06:11:13,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 345. [2025-03-17 06:11:13,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 287 states have (on average 1.3066202090592334) internal successors, (375), 287 states have internal predecessors, (375), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 06:11:13,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 483 transitions. [2025-03-17 06:11:13,490 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 483 transitions. Word has length 134 [2025-03-17 06:11:13,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:13,490 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 483 transitions. [2025-03-17 06:11:13,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:13,491 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 483 transitions. [2025-03-17 06:11:13,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 06:11:13,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:13,495 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:13,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 06:11:13,495 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:13,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:13,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2102762693, now seen corresponding path program 1 times [2025-03-17 06:11:13,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:13,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834072274] [2025-03-17 06:11:13,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:13,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:13,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 06:11:13,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 06:11:13,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:13,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:13,649 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 06:11:13,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:13,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834072274] [2025-03-17 06:11:13,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834072274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:11:13,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919844248] [2025-03-17 06:11:13,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:13,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:13,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:13,651 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:11:13,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:11:13,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 06:11:13,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 06:11:13,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:13,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:13,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:11:13,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:13,851 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:11:13,851 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:11:13,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919844248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:13,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:11:13,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2025-03-17 06:11:13,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023350698] [2025-03-17 06:11:13,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:13,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:11:13,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:13,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:11:13,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:11:13,853 INFO L87 Difference]: Start difference. First operand 345 states and 483 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:13,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:13,921 INFO L93 Difference]: Finished difference Result 357 states and 496 transitions. [2025-03-17 06:11:13,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:11:13,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2025-03-17 06:11:13,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:13,923 INFO L225 Difference]: With dead ends: 357 [2025-03-17 06:11:13,923 INFO L226 Difference]: Without dead ends: 355 [2025-03-17 06:11:13,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:11:13,924 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:13,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 624 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:11:13,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-17 06:11:13,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2025-03-17 06:11:13,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 297 states have (on average 1.2962962962962963) internal successors, (385), 297 states have internal predecessors, (385), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 06:11:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 493 transitions. [2025-03-17 06:11:13,957 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 493 transitions. Word has length 136 [2025-03-17 06:11:13,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:13,958 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 493 transitions. [2025-03-17 06:11:13,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:13,959 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 493 transitions. [2025-03-17 06:11:13,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 06:11:13,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:13,960 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:13,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 06:11:14,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:14,161 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:14,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:14,161 INFO L85 PathProgramCache]: Analyzing trace with hash -242065062, now seen corresponding path program 1 times [2025-03-17 06:11:14,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:14,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594332364] [2025-03-17 06:11:14,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:14,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:14,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 06:11:14,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 06:11:14,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:14,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 06:11:14,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:14,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594332364] [2025-03-17 06:11:14,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594332364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:11:14,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960800893] [2025-03-17 06:11:14,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:14,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:14,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:14,286 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:11:14,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 06:11:14,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 06:11:14,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 06:11:14,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:14,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:14,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 06:11:14,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:11:14,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:11:14,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960800893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:14,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:11:14,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2025-03-17 06:11:14,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349747331] [2025-03-17 06:11:14,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:14,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:11:14,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:14,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:11:14,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:11:14,476 INFO L87 Difference]: Start difference. First operand 355 states and 493 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:14,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:14,535 INFO L93 Difference]: Finished difference Result 369 states and 508 transitions. [2025-03-17 06:11:14,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:11:14,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 138 [2025-03-17 06:11:14,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:14,538 INFO L225 Difference]: With dead ends: 369 [2025-03-17 06:11:14,538 INFO L226 Difference]: Without dead ends: 367 [2025-03-17 06:11:14,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:11:14,539 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:14,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 721 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:11:14,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-17 06:11:14,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 357. [2025-03-17 06:11:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 299 states have (on average 1.294314381270903) internal successors, (387), 299 states have internal predecessors, (387), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 06:11:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 495 transitions. [2025-03-17 06:11:14,570 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 495 transitions. Word has length 138 [2025-03-17 06:11:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:14,570 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 495 transitions. [2025-03-17 06:11:14,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 495 transitions. [2025-03-17 06:11:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-17 06:11:14,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:14,571 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:14,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 06:11:14,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 06:11:14,772 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:14,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:14,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1532233814, now seen corresponding path program 1 times [2025-03-17 06:11:14,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:14,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442400971] [2025-03-17 06:11:14,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:14,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:14,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-17 06:11:14,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-17 06:11:14,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:14,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2573 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2563 trivial. 0 not checked. [2025-03-17 06:11:15,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:15,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442400971] [2025-03-17 06:11:15,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442400971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:11:15,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111388004] [2025-03-17 06:11:15,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:15,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:15,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:15,426 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:11:15,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 06:11:15,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-17 06:11:15,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-17 06:11:15,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:15,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:15,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 06:11:15,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:18,351 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-17 06:11:18,388 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 27 treesize of output 34 [2025-03-17 06:11:18,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2573 backedges. 50 proven. 65 refuted. 0 times theorem prover too weak. 2458 trivial. 0 not checked. [2025-03-17 06:11:18,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:11:18,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:11:18,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5050 treesize of output 4293 [2025-03-17 06:11:19,539 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-17 06:11:20,111 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:20,158 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-17 06:11:20,762 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 06:11:20,798 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 06:11:20,825 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:20,833 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:20,846 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 06:11:20,868 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:20,874 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:20,884 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:20,891 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:20,905 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-17 06:11:20,909 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-17 06:11:20,913 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:20,923 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 06:11:20,962 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 06:11:20,977 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 06:11:20,992 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:20,998 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:21,009 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 06:11:21,024 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:21,031 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:21,040 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:21,049 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:21,063 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-17 06:11:21,069 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-17 06:11:21,075 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:21,087 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 06:11:21,167 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 06:11:21,289 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 06:11:21,310 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:21,325 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-17 06:11:21,386 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 06:11:21,404 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:21,429 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-17 06:11:21,850 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:21,860 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-17 06:11:22,076 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-17 06:11:23,339 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-17 06:11:23,852 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:23,862 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-17 06:11:24,370 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 06:11:24,389 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 06:11:24,403 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:24,410 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:24,420 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 06:11:24,435 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:24,445 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:24,457 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:24,467 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:24,481 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-17 06:11:24,487 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-17 06:11:24,492 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:24,502 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 06:11:24,541 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 06:11:24,561 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 06:11:24,580 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:24,588 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:24,600 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 06:11:24,615 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:24,622 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:24,633 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:24,641 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:24,656 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-17 06:11:24,661 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-17 06:11:24,665 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:24,676 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 06:11:24,723 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 06:11:24,825 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 06:11:24,842 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:24,860 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-17 06:11:24,901 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 06:11:24,923 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:24,933 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-17 06:11:25,209 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 06:11:25,217 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-17 06:11:25,390 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-17 06:11:28,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2573 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2560 trivial. 0 not checked. [2025-03-17 06:11:28,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111388004] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:11:28,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:11:28,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-17 06:11:28,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511846451] [2025-03-17 06:11:28,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:11:28,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:11:28,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:28,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:11:28,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:11:28,447 INFO L87 Difference]: Start difference. First operand 357 states and 495 transitions. Second operand has 14 states, 14 states have (on average 12.5) internal successors, (175), 14 states have internal predecessors, (175), 3 states have call successors, (54), 2 states have call predecessors, (54), 3 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2025-03-17 06:11:28,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:28,892 INFO L93 Difference]: Finished difference Result 615 states and 851 transitions. [2025-03-17 06:11:28,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:11:28,893 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.5) internal successors, (175), 14 states have internal predecessors, (175), 3 states have call successors, (54), 2 states have call predecessors, (54), 3 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 262 [2025-03-17 06:11:28,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:28,895 INFO L225 Difference]: With dead ends: 615 [2025-03-17 06:11:28,895 INFO L226 Difference]: Without dead ends: 471 [2025-03-17 06:11:28,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:11:28,896 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 74 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:28,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 435 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:11:28,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-17 06:11:28,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 387. [2025-03-17 06:11:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 329 states have (on average 1.2948328267477203) internal successors, (426), 329 states have internal predecessors, (426), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 06:11:28,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 534 transitions. [2025-03-17 06:11:28,941 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 534 transitions. Word has length 262 [2025-03-17 06:11:28,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:28,942 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 534 transitions. [2025-03-17 06:11:28,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.5) internal successors, (175), 14 states have internal predecessors, (175), 3 states have call successors, (54), 2 states have call predecessors, (54), 3 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2025-03-17 06:11:28,942 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 534 transitions. [2025-03-17 06:11:28,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-17 06:11:28,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:28,944 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:28,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 06:11:29,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 06:11:29,145 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:29,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:29,146 INFO L85 PathProgramCache]: Analyzing trace with hash 955279019, now seen corresponding path program 1 times [2025-03-17 06:11:29,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:29,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416222319] [2025-03-17 06:11:29,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:29,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:29,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-17 06:11:29,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-17 06:11:29,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:29,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:29,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2573 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 2562 trivial. 0 not checked. [2025-03-17 06:11:29,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:29,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416222319] [2025-03-17 06:11:29,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416222319] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:11:29,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713226731] [2025-03-17 06:11:29,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:29,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:29,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:29,440 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:11:29,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 06:11:29,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-17 06:11:29,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-17 06:11:29,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:29,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:29,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 06:11:29,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:31,422 INFO L349 Elim1Store]: treesize reduction 50, result has 38.3 percent of original size [2025-03-17 06:11:31,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 55 [2025-03-17 06:11:31,459 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 17 treesize of output 9 [2025-03-17 06:11:31,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2573 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 2562 trivial. 0 not checked. [2025-03-17 06:11:31,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:11:35,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:11:35,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2025-03-17 06:11:36,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2573 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 2562 trivial. 0 not checked. [2025-03-17 06:11:36,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713226731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:11:36,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:11:36,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2025-03-17 06:11:36,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240609746] [2025-03-17 06:11:36,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:11:36,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 06:11:36,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:36,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 06:11:36,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=117, Unknown=1, NotChecked=0, Total=156 [2025-03-17 06:11:36,093 INFO L87 Difference]: Start difference. First operand 387 states and 534 transitions. Second operand has 13 states, 13 states have (on average 13.0) internal successors, (169), 13 states have internal predecessors, (169), 3 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2025-03-17 06:11:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:36,450 INFO L93 Difference]: Finished difference Result 669 states and 920 transitions. [2025-03-17 06:11:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:11:36,451 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 13.0) internal successors, (169), 13 states have internal predecessors, (169), 3 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) Word has length 262 [2025-03-17 06:11:36,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:36,454 INFO L225 Difference]: With dead ends: 669 [2025-03-17 06:11:36,454 INFO L226 Difference]: Without dead ends: 495 [2025-03-17 06:11:36,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=65, Invalid=174, Unknown=1, NotChecked=0, Total=240 [2025-03-17 06:11:36,455 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 154 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:36,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 292 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:11:36,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-17 06:11:36,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 387. [2025-03-17 06:11:36,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 329 states have (on average 1.2948328267477203) internal successors, (426), 329 states have internal predecessors, (426), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 06:11:36,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 534 transitions. [2025-03-17 06:11:36,506 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 534 transitions. Word has length 262 [2025-03-17 06:11:36,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:36,506 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 534 transitions. [2025-03-17 06:11:36,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.0) internal successors, (169), 13 states have internal predecessors, (169), 3 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2025-03-17 06:11:36,507 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 534 transitions. [2025-03-17 06:11:36,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-17 06:11:36,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:36,510 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:36,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 06:11:36,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 06:11:36,710 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:36,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:36,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1403151095, now seen corresponding path program 1 times [2025-03-17 06:11:36,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:36,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101966112] [2025-03-17 06:11:36,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:36,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:36,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-17 06:11:36,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-17 06:11:36,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:36,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:36,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2573 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 2562 trivial. 0 not checked. [2025-03-17 06:11:36,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:36,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101966112] [2025-03-17 06:11:36,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101966112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:11:36,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102543584] [2025-03-17 06:11:36,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:36,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:36,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:36,979 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:11:36,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 06:11:37,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-17 06:11:37,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-17 06:11:37,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:37,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:37,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 06:11:37,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:38,251 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 8 treesize of output 1 [2025-03-17 06:11:38,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:38,280 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 25 treesize of output 13 [2025-03-17 06:11:38,291 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 17 treesize of output 9 [2025-03-17 06:11:38,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2573 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 2560 trivial. 0 not checked. [2025-03-17 06:11:38,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:11:42,371 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 06:11:42,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 302 treesize of output 282 [2025-03-17 06:11:42,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 114 treesize of output 108 [2025-03-17 06:11:42,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 114 treesize of output 106 [2025-03-17 06:11:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2573 backedges. 7 proven. 3 refuted. 3 times theorem prover too weak. 2560 trivial. 0 not checked. [2025-03-17 06:11:50,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102543584] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:11:50,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:11:50,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 14 [2025-03-17 06:11:50,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611972893] [2025-03-17 06:11:50,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:11:50,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:11:50,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:50,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:11:50,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=129, Unknown=3, NotChecked=0, Total=182 [2025-03-17 06:11:50,808 INFO L87 Difference]: Start difference. First operand 387 states and 534 transitions. Second operand has 14 states, 14 states have (on average 12.214285714285714) internal successors, (171), 14 states have internal predecessors, (171), 3 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2025-03-17 06:11:51,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:51,304 INFO L93 Difference]: Finished difference Result 778 states and 1086 transitions. [2025-03-17 06:11:51,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:11:51,305 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.214285714285714) internal successors, (171), 14 states have internal predecessors, (171), 3 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) Word has length 262 [2025-03-17 06:11:51,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:51,307 INFO L225 Difference]: With dead ends: 778 [2025-03-17 06:11:51,307 INFO L226 Difference]: Without dead ends: 477 [2025-03-17 06:11:51,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 514 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=81, Invalid=188, Unknown=3, NotChecked=0, Total=272 [2025-03-17 06:11:51,308 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 67 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:51,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 405 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:11:51,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-03-17 06:11:51,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 393. [2025-03-17 06:11:51,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 335 states have (on average 1.2895522388059701) internal successors, (432), 335 states have internal predecessors, (432), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 06:11:51,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 540 transitions. [2025-03-17 06:11:51,346 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 540 transitions. Word has length 262 [2025-03-17 06:11:51,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:51,347 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 540 transitions. [2025-03-17 06:11:51,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.214285714285714) internal successors, (171), 14 states have internal predecessors, (171), 3 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2025-03-17 06:11:51,347 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 540 transitions. [2025-03-17 06:11:51,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-17 06:11:51,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:51,348 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:51,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 06:11:51,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:51,549 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:51,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:51,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1084361738, now seen corresponding path program 1 times [2025-03-17 06:11:51,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:51,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949038847] [2025-03-17 06:11:51,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:51,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:51,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-17 06:11:51,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-17 06:11:51,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:51,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:53,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2573 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 2553 trivial. 0 not checked. [2025-03-17 06:11:53,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:53,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949038847] [2025-03-17 06:11:53,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949038847] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:11:53,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730248572] [2025-03-17 06:11:53,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:53,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:53,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:53,324 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:11:53,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 06:11:53,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-17 06:11:53,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-17 06:11:53,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:53,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:53,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 06:11:53,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:56,368 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 8 treesize of output 1 [2025-03-17 06:11:56,406 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 21 treesize of output 24 [2025-03-17 06:11:56,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2573 backedges. 47 proven. 71 refuted. 0 times theorem prover too weak. 2455 trivial. 0 not checked. [2025-03-17 06:11:56,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:11:56,576 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-03-17 06:11:56,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5622 treesize of output 4806 [2025-03-17 06:11:56,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:11:56,619 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 894 treesize of output 806 [2025-03-17 06:11:56,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 106 treesize of output 98 [2025-03-17 06:11:57,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:11:57,016 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 673 treesize of output 633 [2025-03-17 06:11:58,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 162 treesize of output 156 [2025-03-17 06:11:58,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 164 treesize of output 158 [2025-03-17 06:11:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2573 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2560 trivial. 0 not checked. [2025-03-17 06:11:59,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730248572] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:11:59,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:11:59,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 19 [2025-03-17 06:11:59,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877440411] [2025-03-17 06:11:59,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:11:59,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 06:11:59,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:59,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 06:11:59,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:11:59,150 INFO L87 Difference]: Start difference. First operand 393 states and 540 transitions. Second operand has 19 states, 19 states have (on average 9.631578947368421) internal successors, (183), 19 states have internal predecessors, (183), 5 states have call successors, (56), 2 states have call predecessors, (56), 3 states have return successors, (57), 5 states have call predecessors, (57), 5 states have call successors, (57) [2025-03-17 06:11:59,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:59,792 INFO L93 Difference]: Finished difference Result 796 states and 1098 transitions. [2025-03-17 06:11:59,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:11:59,794 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 9.631578947368421) internal successors, (183), 19 states have internal predecessors, (183), 5 states have call successors, (56), 2 states have call predecessors, (56), 3 states have return successors, (57), 5 states have call predecessors, (57), 5 states have call successors, (57) Word has length 262 [2025-03-17 06:11:59,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:59,796 INFO L225 Difference]: With dead ends: 796 [2025-03-17 06:11:59,796 INFO L226 Difference]: Without dead ends: 489 [2025-03-17 06:11:59,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=504, Unknown=0, NotChecked=0, Total=702 [2025-03-17 06:11:59,798 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 162 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:59,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 391 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:11:59,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-17 06:11:59,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 393. [2025-03-17 06:11:59,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 335 states have (on average 1.2895522388059701) internal successors, (432), 335 states have internal predecessors, (432), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 06:11:59,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 540 transitions. [2025-03-17 06:11:59,878 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 540 transitions. Word has length 262 [2025-03-17 06:11:59,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:59,878 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 540 transitions. [2025-03-17 06:11:59,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.631578947368421) internal successors, (183), 19 states have internal predecessors, (183), 5 states have call successors, (56), 2 states have call predecessors, (56), 3 states have return successors, (57), 5 states have call predecessors, (57), 5 states have call successors, (57) [2025-03-17 06:11:59,879 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 540 transitions. [2025-03-17 06:11:59,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-17 06:11:59,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:59,881 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:59,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 06:12:00,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:00,082 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:00,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:00,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1599664600, now seen corresponding path program 1 times [2025-03-17 06:12:00,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:00,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740698614] [2025-03-17 06:12:00,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:00,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:00,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-17 06:12:00,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-17 06:12:00,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:00,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2573 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 2555 trivial. 0 not checked. [2025-03-17 06:12:00,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:00,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740698614] [2025-03-17 06:12:00,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740698614] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:12:00,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116798148] [2025-03-17 06:12:00,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:00,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:00,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:00,550 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:12:00,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 06:12:00,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-17 06:12:00,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-17 06:12:00,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:00,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:00,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-17 06:12:00,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:00,846 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-17 06:12:00,941 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 102 treesize of output 75 [2025-03-17 06:12:01,672 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 109 treesize of output 80 [2025-03-17 06:12:02,218 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 109 treesize of output 80 [2025-03-17 06:12:02,763 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 109 treesize of output 80 [2025-03-17 06:12:03,366 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 109 treesize of output 80 [2025-03-17 06:12:04,194 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 118 treesize of output 87