./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-5.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 ca2f933d67faf408af35a2606c62cae5d484e0ad1d571925efee98edf8420268 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:24:25,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:24:25,166 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:24:25,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:24:25,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:24:25,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:24:25,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:24:25,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:24:25,189 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:24:25,189 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:24:25,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:24:25,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:24:25,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:24:25,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:24:25,191 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:24:25,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:24:25,191 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:24:25,191 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:24:25,191 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:24:25,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:24:25,192 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:24:25,192 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:24:25,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:24:25,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:24:25,192 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:24:25,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:24:25,192 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:24:25,192 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:24:25,192 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:24:25,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:24:25,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:24:25,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:24:25,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:24:25,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:24:25,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:24:25,193 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:24:25,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:24:25,193 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:24:25,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:24:25,193 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:24:25,194 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:24:25,194 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:24:25,194 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:24:25,194 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 -> ca2f933d67faf408af35a2606c62cae5d484e0ad1d571925efee98edf8420268 [2025-03-17 05:24:25,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:24:25,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:24:25,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:24:25,402 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:24:25,402 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:24:25,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-5.i [2025-03-17 05:24:26,552 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c649701e/fe06ae77cbc74b5a81c776b481bd7d6b/FLAG1de87bc65 [2025-03-17 05:24:26,819 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:24:26,820 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-5.i [2025-03-17 05:24:26,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c649701e/fe06ae77cbc74b5a81c776b481bd7d6b/FLAG1de87bc65 [2025-03-17 05:24:27,119 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c649701e/fe06ae77cbc74b5a81c776b481bd7d6b [2025-03-17 05:24:27,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:24:27,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:24:27,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:24:27,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:24:27,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:24:27,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:24:27" (1/1) ... [2025-03-17 05:24:27,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a4228cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:27, skipping insertion in model container [2025-03-17 05:24:27,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:24:27" (1/1) ... [2025-03-17 05:24:27,144 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:24:27,236 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-5.i[915,928] [2025-03-17 05:24:27,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:24:27,285 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:24:27,292 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-5.i[915,928] [2025-03-17 05:24:27,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:24:27,327 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:24:27,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:27 WrapperNode [2025-03-17 05:24:27,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:24:27,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:24:27,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:24:27,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:24:27,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:27" (1/1) ... [2025-03-17 05:24:27,344 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:27" (1/1) ... [2025-03-17 05:24:27,371 INFO L138 Inliner]: procedures = 26, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 415 [2025-03-17 05:24:27,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:24:27,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:24:27,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:24:27,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:24:27,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:27" (1/1) ... [2025-03-17 05:24:27,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:27" (1/1) ... [2025-03-17 05:24:27,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:27" (1/1) ... [2025-03-17 05:24:27,405 INFO L175 MemorySlicer]: Split 122 memory accesses to 6 slices as follows [2, 6, 3, 28, 59, 24]. 48 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 6, 4, 3]. The 17 writes are split as follows [0, 1, 1, 6, 6, 3]. [2025-03-17 05:24:27,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:27" (1/1) ... [2025-03-17 05:24:27,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:27" (1/1) ... [2025-03-17 05:24:27,420 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:27" (1/1) ... [2025-03-17 05:24:27,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:27" (1/1) ... [2025-03-17 05:24:27,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:27" (1/1) ... [2025-03-17 05:24:27,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:27" (1/1) ... [2025-03-17 05:24:27,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:24:27,433 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:24:27,434 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:24:27,434 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:24:27,434 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:27" (1/1) ... [2025-03-17 05:24:27,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:24:27,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:24:27,461 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:24:27,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:24:27,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:24:27,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:24:27,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:24:27,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:24:27,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:24:27,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:24:27,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:24:27,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:24:27,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:24:27,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:24:27,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:24:27,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:24:27,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:24:27,484 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:24:27,484 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:24:27,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:24:27,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:24:27,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:24:27,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:24:27,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:24:27,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:24:27,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:24:27,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:24:27,560 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:24:27,562 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:24:27,929 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~ite76#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem79#1;havoc property_#t~ite91#1;havoc property_#t~mem82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite90#1;havoc property_#t~ite87#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~short92#1;havoc property_#t~mem96#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite105#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~short106#1;havoc property_#t~mem107#1;havoc property_#t~short108#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~short111#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~short114#1; [2025-03-17 05:24:27,959 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2025-03-17 05:24:27,959 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:24:27,969 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:24:27,970 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:24:27,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:24:27 BoogieIcfgContainer [2025-03-17 05:24:27,970 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:24:27,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:24:27,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:24:27,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:24:27,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:24:27" (1/3) ... [2025-03-17 05:24:27,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@895ce10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:24:27, skipping insertion in model container [2025-03-17 05:24:27,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:27" (2/3) ... [2025-03-17 05:24:27,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@895ce10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:24:27, skipping insertion in model container [2025-03-17 05:24:27,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:24:27" (3/3) ... [2025-03-17 05:24:27,977 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-5.i [2025-03-17 05:24:27,987 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:24:27,988 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-5.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:24:28,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:24:28,036 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;@1cc3df8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:24:28,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:24:28,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 67 states have internal predecessors, (89), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:24:28,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:24:28,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:28,049 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:28,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:28,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:28,054 INFO L85 PathProgramCache]: Analyzing trace with hash -976525272, now seen corresponding path program 1 times [2025-03-17 05:24:28,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:28,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624418947] [2025-03-17 05:24:28,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:28,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:28,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:24:28,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:24:28,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:28,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:28,318 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 05:24:28,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:28,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624418947] [2025-03-17 05:24:28,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624418947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:28,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411258003] [2025-03-17 05:24:28,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:28,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:24:28,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:24:28,322 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:24:28,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:24:28,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:24:28,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:24:28,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:28,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:28,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:24:28,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:28,510 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 05:24:28,510 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:28,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411258003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:28,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:28,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:24:28,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974113723] [2025-03-17 05:24:28,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:28,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:24:28,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:28,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:24:28,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:24:28,533 INFO L87 Difference]: Start difference. First operand has 89 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 67 states have internal predecessors, (89), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:24:28,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:28,553 INFO L93 Difference]: Finished difference Result 175 states and 276 transitions. [2025-03-17 05:24:28,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:24:28,555 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 143 [2025-03-17 05:24:28,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:28,559 INFO L225 Difference]: With dead ends: 175 [2025-03-17 05:24:28,559 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 05:24:28,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:24:28,563 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:28,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:28,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 05:24:28,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 05:24:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:24:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2025-03-17 05:24:28,592 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 143 [2025-03-17 05:24:28,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:28,593 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2025-03-17 05:24:28,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:24:28,594 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2025-03-17 05:24:28,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:24:28,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:28,600 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:28,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:24:28,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:24:28,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:28,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:28,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1207575996, now seen corresponding path program 1 times [2025-03-17 05:24:28,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:28,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499985651] [2025-03-17 05:24:28,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:28,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:28,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:24:28,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:24:28,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:28,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:24:29,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:29,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499985651] [2025-03-17 05:24:29,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499985651] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:29,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313520088] [2025-03-17 05:24:29,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:29,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:24:29,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:24:29,188 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:24:29,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:24:29,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:24:29,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:24:29,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:29,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:29,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:24:29,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:29,382 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:29,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313520088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:29,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:29,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 05:24:29,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812634742] [2025-03-17 05:24:29,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:29,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:24:29,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:29,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:24:29,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:24:29,386 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:29,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:29,418 INFO L93 Difference]: Finished difference Result 176 states and 253 transitions. [2025-03-17 05:24:29,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:24:29,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-03-17 05:24:29,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:29,421 INFO L225 Difference]: With dead ends: 176 [2025-03-17 05:24:29,423 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 05:24:29,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:24:29,424 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:29,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 355 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:29,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 05:24:29,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2025-03-17 05:24:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:24:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2025-03-17 05:24:29,438 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 143 [2025-03-17 05:24:29,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:29,439 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2025-03-17 05:24:29,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:29,440 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2025-03-17 05:24:29,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:24:29,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:29,460 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:29,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:24:29,660 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,SelfDestructingSolverStorable1 [2025-03-17 05:24:29,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:29,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:29,661 INFO L85 PathProgramCache]: Analyzing trace with hash -599878467, now seen corresponding path program 1 times [2025-03-17 05:24:29,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:29,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546696228] [2025-03-17 05:24:29,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:29,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:29,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:24:29,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:24:29,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:29,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:24:29,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:29,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546696228] [2025-03-17 05:24:29,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546696228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:29,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874851150] [2025-03-17 05:24:29,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:29,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:24:29,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:24:29,860 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:24:29,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:24:29,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:24:30,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:24:30,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:30,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:30,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:24:30,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:30,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:30,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874851150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:30,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:30,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 05:24:30,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103780544] [2025-03-17 05:24:30,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:30,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:24:30,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:30,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:24:30,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:24:30,044 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:30,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:30,076 INFO L93 Difference]: Finished difference Result 180 states and 257 transitions. [2025-03-17 05:24:30,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:24:30,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-03-17 05:24:30,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:30,081 INFO L225 Difference]: With dead ends: 180 [2025-03-17 05:24:30,082 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 05:24:30,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:24:30,083 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:30,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 356 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:30,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 05:24:30,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2025-03-17 05:24:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:24:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2025-03-17 05:24:30,093 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 143 [2025-03-17 05:24:30,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:30,094 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2025-03-17 05:24:30,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:30,094 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2025-03-17 05:24:30,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:24:30,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:30,097 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:30,105 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 05:24:30,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:24:30,298 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:30,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:30,299 INFO L85 PathProgramCache]: Analyzing trace with hash 287625214, now seen corresponding path program 1 times [2025-03-17 05:24:30,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:30,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464688979] [2025-03-17 05:24:30,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:30,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:30,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:24:30,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:24:30,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:30,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:24:30,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:30,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464688979] [2025-03-17 05:24:30,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464688979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:30,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342344961] [2025-03-17 05:24:30,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:30,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:24:30,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:24:30,474 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 05:24:30,475 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 05:24:30,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:24:30,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:24:30,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:30,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:30,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:24:30,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:30,649 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:30,649 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:30,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342344961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:30,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:30,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 05:24:30,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661769587] [2025-03-17 05:24:30,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:30,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:24:30,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:30,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:24:30,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:24:30,653 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:30,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:30,679 INFO L93 Difference]: Finished difference Result 184 states and 261 transitions. [2025-03-17 05:24:30,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:24:30,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-03-17 05:24:30,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:30,681 INFO L225 Difference]: With dead ends: 184 [2025-03-17 05:24:30,681 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 05:24:30,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:24:30,682 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:30,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 358 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:30,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 05:24:30,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-03-17 05:24:30,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 71 states have internal predecessors, (91), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:24:30,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2025-03-17 05:24:30,693 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 143 [2025-03-17 05:24:30,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:30,694 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2025-03-17 05:24:30,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2025-03-17 05:24:30,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:24:30,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:30,697 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:30,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 05:24:30,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:24:30,898 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:30,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:30,898 INFO L85 PathProgramCache]: Analyzing trace with hash 288548735, now seen corresponding path program 1 times [2025-03-17 05:24:30,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:30,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154543530] [2025-03-17 05:24:30,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:30,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:30,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:24:30,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:24:30,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:30,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:24:31,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:31,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154543530] [2025-03-17 05:24:31,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154543530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:31,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040943795] [2025-03-17 05:24:31,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:31,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:24:31,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:24:31,062 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 05:24:31,063 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 05:24:31,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:24:31,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:24:31,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:31,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:31,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:24:31,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:31,221 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:31,221 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:31,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040943795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:31,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:31,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 05:24:31,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625175688] [2025-03-17 05:24:31,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:31,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:24:31,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:31,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:24:31,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:24:31,223 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:31,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:31,241 INFO L93 Difference]: Finished difference Result 187 states and 264 transitions. [2025-03-17 05:24:31,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:24:31,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-03-17 05:24:31,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:31,243 INFO L225 Difference]: With dead ends: 187 [2025-03-17 05:24:31,243 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 05:24:31,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:24:31,244 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:31,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:31,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 05:24:31,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-17 05:24:31,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:24:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 133 transitions. [2025-03-17 05:24:31,250 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 133 transitions. Word has length 143 [2025-03-17 05:24:31,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:31,250 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 133 transitions. [2025-03-17 05:24:31,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:31,251 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2025-03-17 05:24:31,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:24:31,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:31,252 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:31,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 05:24:31,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:24:31,456 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:31,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:31,456 INFO L85 PathProgramCache]: Analyzing trace with hash -88211338, now seen corresponding path program 1 times [2025-03-17 05:24:31,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:31,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949241795] [2025-03-17 05:24:31,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:31,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:31,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:24:31,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:24:31,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:31,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:24:31,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:31,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949241795] [2025-03-17 05:24:31,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949241795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:31,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510366186] [2025-03-17 05:24:31,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:31,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:24:31,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:24:31,637 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 05:24:31,638 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 05:24:31,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:24:31,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:24:31,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:31,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:31,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:24:31,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:31,777 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:31,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510366186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:31,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:31,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:24:31,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769314029] [2025-03-17 05:24:31,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:31,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:24:31,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:31,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:24:31,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:24:31,779 INFO L87 Difference]: Start difference. First operand 95 states and 133 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:31,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:31,802 INFO L93 Difference]: Finished difference Result 192 states and 269 transitions. [2025-03-17 05:24:31,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:24:31,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2025-03-17 05:24:31,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:31,804 INFO L225 Difference]: With dead ends: 192 [2025-03-17 05:24:31,804 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 05:24:31,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:24:31,805 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:31,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 471 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:31,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 05:24:31,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-17 05:24:31,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.263157894736842) internal successors, (96), 76 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:24:31,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2025-03-17 05:24:31,810 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 145 [2025-03-17 05:24:31,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:31,811 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2025-03-17 05:24:31,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:31,811 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2025-03-17 05:24:31,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:24:31,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:31,812 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:31,818 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 05:24:32,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:24:32,013 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:32,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:32,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1904327389, now seen corresponding path program 1 times [2025-03-17 05:24:32,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:32,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976620803] [2025-03-17 05:24:32,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:32,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:32,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:24:32,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:24:32,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:32,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:32,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:32,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976620803] [2025-03-17 05:24:32,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976620803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:32,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:32,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:24:32,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260363173] [2025-03-17 05:24:32,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:32,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:24:32,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:32,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:24:32,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:24:32,184 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:32,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:32,232 INFO L93 Difference]: Finished difference Result 195 states and 271 transitions. [2025-03-17 05:24:32,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:24:32,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2025-03-17 05:24:32,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:32,234 INFO L225 Difference]: With dead ends: 195 [2025-03-17 05:24:32,234 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 05:24:32,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:24:32,236 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:32,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:32,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 05:24:32,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-17 05:24:32,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:24:32,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2025-03-17 05:24:32,246 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 145 [2025-03-17 05:24:32,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:32,246 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2025-03-17 05:24:32,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:32,246 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2025-03-17 05:24:32,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:24:32,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:32,248 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:32,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:24:32,248 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:32,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:32,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1393793212, now seen corresponding path program 1 times [2025-03-17 05:24:32,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:32,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416650553] [2025-03-17 05:24:32,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:32,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:32,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:24:32,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:24:32,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:32,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:32,398 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:32,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:32,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416650553] [2025-03-17 05:24:32,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416650553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:32,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:32,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:24:32,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272379140] [2025-03-17 05:24:32,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:32,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:24:32,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:32,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:24:32,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:24:32,401 INFO L87 Difference]: Start difference. First operand 98 states and 135 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:32,412 INFO L93 Difference]: Finished difference Result 195 states and 269 transitions. [2025-03-17 05:24:32,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:24:32,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2025-03-17 05:24:32,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:32,415 INFO L225 Difference]: With dead ends: 195 [2025-03-17 05:24:32,415 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 05:24:32,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:24:32,416 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:32,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:32,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 05:24:32,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-17 05:24:32,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.236842105263158) internal successors, (94), 76 states have internal predecessors, (94), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:24:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 134 transitions. [2025-03-17 05:24:32,424 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 134 transitions. Word has length 145 [2025-03-17 05:24:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:32,426 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 134 transitions. [2025-03-17 05:24:32,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:32,426 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 134 transitions. [2025-03-17 05:24:32,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:24:32,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:32,427 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:32,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:24:32,427 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:32,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:32,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1536420250, now seen corresponding path program 1 times [2025-03-17 05:24:32,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:32,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582247681] [2025-03-17 05:24:32,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:32,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:32,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:24:32,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:24:32,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:32,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:32,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:32,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582247681] [2025-03-17 05:24:32,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582247681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:32,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:32,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:24:32,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345979102] [2025-03-17 05:24:32,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:32,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:24:32,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:32,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:24:32,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:24:32,547 INFO L87 Difference]: Start difference. First operand 98 states and 134 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:32,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:32,589 INFO L93 Difference]: Finished difference Result 195 states and 267 transitions. [2025-03-17 05:24:32,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:24:32,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 147 [2025-03-17 05:24:32,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:32,590 INFO L225 Difference]: With dead ends: 195 [2025-03-17 05:24:32,590 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 05:24:32,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:24:32,591 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:32,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:32,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 05:24:32,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-17 05:24:32,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:24:32,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 133 transitions. [2025-03-17 05:24:32,601 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 133 transitions. Word has length 147 [2025-03-17 05:24:32,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:32,602 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 133 transitions. [2025-03-17 05:24:32,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:32,602 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 133 transitions. [2025-03-17 05:24:32,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:24:32,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:32,603 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:32,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:24:32,603 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:32,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:32,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1127596025, now seen corresponding path program 1 times [2025-03-17 05:24:32,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:32,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791721547] [2025-03-17 05:24:32,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:32,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:32,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:24:32,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:24:32,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:32,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:33,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:33,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791721547] [2025-03-17 05:24:33,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791721547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:33,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:33,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:24:33,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534704265] [2025-03-17 05:24:33,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:33,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:24:33,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:33,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:24:33,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:24:33,625 INFO L87 Difference]: Start difference. First operand 98 states and 133 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:34,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:34,151 INFO L93 Difference]: Finished difference Result 348 states and 477 transitions. [2025-03-17 05:24:34,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:24:34,152 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 147 [2025-03-17 05:24:34,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:34,153 INFO L225 Difference]: With dead ends: 348 [2025-03-17 05:24:34,153 INFO L226 Difference]: Without dead ends: 251 [2025-03-17 05:24:34,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:24:34,154 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 177 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:34,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 839 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:24:34,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-17 05:24:34,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 189. [2025-03-17 05:24:34,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 146 states have (on average 1.2123287671232876) internal successors, (177), 146 states have internal predecessors, (177), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:24:34,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 257 transitions. [2025-03-17 05:24:34,173 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 257 transitions. Word has length 147 [2025-03-17 05:24:34,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:34,173 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 257 transitions. [2025-03-17 05:24:34,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:34,173 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 257 transitions. [2025-03-17 05:24:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 05:24:34,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:34,174 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:34,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:24:34,175 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:34,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:34,175 INFO L85 PathProgramCache]: Analyzing trace with hash 258710053, now seen corresponding path program 1 times [2025-03-17 05:24:34,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:34,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526120936] [2025-03-17 05:24:34,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:34,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:34,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 05:24:34,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 05:24:34,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:34,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:35,409 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:35,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:35,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526120936] [2025-03-17 05:24:35,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526120936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:35,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:35,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:24:35,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635688130] [2025-03-17 05:24:35,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:35,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:24:35,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:35,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:24:35,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:24:35,411 INFO L87 Difference]: Start difference. First operand 189 states and 257 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:24:35,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:35,857 INFO L93 Difference]: Finished difference Result 350 states and 479 transitions. [2025-03-17 05:24:35,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:24:35,857 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 148 [2025-03-17 05:24:35,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:35,859 INFO L225 Difference]: With dead ends: 350 [2025-03-17 05:24:35,859 INFO L226 Difference]: Without dead ends: 253 [2025-03-17 05:24:35,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:24:35,859 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 114 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:35,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1484 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:24:35,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-17 05:24:35,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 96. [2025-03-17 05:24:35,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2162162162162162) internal successors, (90), 74 states have internal predecessors, (90), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:24:35,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 130 transitions. [2025-03-17 05:24:35,871 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 130 transitions. Word has length 148 [2025-03-17 05:24:35,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:35,872 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 130 transitions. [2025-03-17 05:24:35,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:24:35,872 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 130 transitions. [2025-03-17 05:24:35,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:24:35,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:35,874 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:35,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:24:35,874 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:35,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:35,875 INFO L85 PathProgramCache]: Analyzing trace with hash 715005944, now seen corresponding path program 1 times [2025-03-17 05:24:35,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:35,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378599165] [2025-03-17 05:24:35,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:35,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:35,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:24:35,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:24:35,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:35,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:36,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:36,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378599165] [2025-03-17 05:24:36,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378599165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:36,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:36,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:24:36,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324551174] [2025-03-17 05:24:36,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:36,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:24:36,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:36,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:24:36,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:24:36,119 INFO L87 Difference]: Start difference. First operand 96 states and 130 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:36,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:36,174 INFO L93 Difference]: Finished difference Result 191 states and 259 transitions. [2025-03-17 05:24:36,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:24:36,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 149 [2025-03-17 05:24:36,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:36,176 INFO L225 Difference]: With dead ends: 191 [2025-03-17 05:24:36,176 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 05:24:36,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:24:36,177 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:36,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 05:24:36,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-17 05:24:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 74 states have internal predecessors, (89), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:24:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2025-03-17 05:24:36,186 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 129 transitions. Word has length 149 [2025-03-17 05:24:36,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:36,188 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 129 transitions. [2025-03-17 05:24:36,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:36,188 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 129 transitions. [2025-03-17 05:24:36,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:24:36,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:36,191 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:36,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:24:36,191 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:36,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:36,192 INFO L85 PathProgramCache]: Analyzing trace with hash 100065141, now seen corresponding path program 1 times [2025-03-17 05:24:36,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:36,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007687602] [2025-03-17 05:24:36,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:36,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:36,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:24:36,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:24:36,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:36,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:36,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:36,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007687602] [2025-03-17 05:24:36,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007687602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:36,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:36,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:24:36,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337398187] [2025-03-17 05:24:36,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:36,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:24:36,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:36,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:24:36,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:24:36,532 INFO L87 Difference]: Start difference. First operand 96 states and 129 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:24:36,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:36,573 INFO L93 Difference]: Finished difference Result 230 states and 304 transitions. [2025-03-17 05:24:36,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:24:36,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 151 [2025-03-17 05:24:36,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:36,574 INFO L225 Difference]: With dead ends: 230 [2025-03-17 05:24:36,574 INFO L226 Difference]: Without dead ends: 135 [2025-03-17 05:24:36,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:24:36,576 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 60 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:36,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 445 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:36,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-17 05:24:36,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2025-03-17 05:24:36,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.1910112359550562) internal successors, (106), 89 states have internal predecessors, (106), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:24:36,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 146 transitions. [2025-03-17 05:24:36,584 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 146 transitions. Word has length 151 [2025-03-17 05:24:36,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:36,585 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 146 transitions. [2025-03-17 05:24:36,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:24:36,585 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 146 transitions. [2025-03-17 05:24:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:24:36,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:36,586 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:36,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:24:36,586 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:36,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:36,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1536397785, now seen corresponding path program 1 times [2025-03-17 05:24:36,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:36,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114157963] [2025-03-17 05:24:36,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:36,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:36,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:24:36,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:24:36,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:36,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:24:37,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:37,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114157963] [2025-03-17 05:24:37,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114157963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:37,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810052657] [2025-03-17 05:24:37,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:37,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:24:37,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:24:37,374 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 05:24:37,376 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 05:24:37,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:24:37,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:24:37,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:37,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:37,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 05:24:37,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:37,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 05:24:37,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 05:24:37,558 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 30 treesize of output 31 [2025-03-17 05:24:37,809 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:37,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:37,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810052657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:37,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:37,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 17 [2025-03-17 05:24:37,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810637993] [2025-03-17 05:24:37,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:37,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:24:37,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:37,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:24:37,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:24:37,811 INFO L87 Difference]: Start difference. First operand 111 states and 146 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:38,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:38,118 INFO L93 Difference]: Finished difference Result 137 states and 179 transitions. [2025-03-17 05:24:38,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:24:38,119 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 151 [2025-03-17 05:24:38,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:38,120 INFO L225 Difference]: With dead ends: 137 [2025-03-17 05:24:38,120 INFO L226 Difference]: Without dead ends: 135 [2025-03-17 05:24:38,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:24:38,121 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 52 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:38,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 723 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:24:38,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-17 05:24:38,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2025-03-17 05:24:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 103 states have (on average 1.1650485436893203) internal successors, (120), 104 states have internal predecessors, (120), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:24:38,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 176 transitions. [2025-03-17 05:24:38,133 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 176 transitions. Word has length 151 [2025-03-17 05:24:38,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:38,134 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 176 transitions. [2025-03-17 05:24:38,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:38,134 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 176 transitions. [2025-03-17 05:24:38,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:24:38,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:38,136 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:38,147 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 05:24:38,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:24:38,337 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:38,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:38,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1535474264, now seen corresponding path program 1 times [2025-03-17 05:24:38,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:38,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642043925] [2025-03-17 05:24:38,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:38,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:38,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:24:38,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:24:38,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:38,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:38,922 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:38,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:38,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642043925] [2025-03-17 05:24:38,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642043925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:38,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:38,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:24:38,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539348924] [2025-03-17 05:24:38,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:38,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:24:38,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:38,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:24:38,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:24:38,925 INFO L87 Difference]: Start difference. First operand 134 states and 176 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:39,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:39,193 INFO L93 Difference]: Finished difference Result 385 states and 505 transitions. [2025-03-17 05:24:39,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:24:39,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 151 [2025-03-17 05:24:39,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:39,195 INFO L225 Difference]: With dead ends: 385 [2025-03-17 05:24:39,195 INFO L226 Difference]: Without dead ends: 268 [2025-03-17 05:24:39,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:24:39,195 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 116 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:39,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 532 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:24:39,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-17 05:24:39,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 251. [2025-03-17 05:24:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 185 states have (on average 1.135135135135135) internal successors, (210), 186 states have internal predecessors, (210), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:24:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 330 transitions. [2025-03-17 05:24:39,221 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 330 transitions. Word has length 151 [2025-03-17 05:24:39,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:39,223 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 330 transitions. [2025-03-17 05:24:39,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:39,223 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 330 transitions. [2025-03-17 05:24:39,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:24:39,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:39,225 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:39,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:24:39,225 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:39,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:39,226 INFO L85 PathProgramCache]: Analyzing trace with hash -647970583, now seen corresponding path program 1 times [2025-03-17 05:24:39,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:39,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506575382] [2025-03-17 05:24:39,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:39,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:39,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:24:39,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:24:39,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:39,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:39,378 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:39,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:39,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506575382] [2025-03-17 05:24:39,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506575382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:39,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:39,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:24:39,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591151591] [2025-03-17 05:24:39,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:39,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:24:39,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:39,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:24:39,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:24:39,380 INFO L87 Difference]: Start difference. First operand 251 states and 330 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:39,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:39,427 INFO L93 Difference]: Finished difference Result 479 states and 625 transitions. [2025-03-17 05:24:39,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:24:39,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 151 [2025-03-17 05:24:39,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:39,429 INFO L225 Difference]: With dead ends: 479 [2025-03-17 05:24:39,429 INFO L226 Difference]: Without dead ends: 273 [2025-03-17 05:24:39,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:24:39,430 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 107 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:39,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 661 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:39,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-17 05:24:39,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 251. [2025-03-17 05:24:39,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 185 states have (on average 1.1243243243243244) internal successors, (208), 186 states have internal predecessors, (208), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:24:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 328 transitions. [2025-03-17 05:24:39,449 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 328 transitions. Word has length 151 [2025-03-17 05:24:39,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:39,449 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 328 transitions. [2025-03-17 05:24:39,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:39,449 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 328 transitions. [2025-03-17 05:24:39,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:24:39,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:39,450 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:39,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:24:39,450 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:39,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:39,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1839542250, now seen corresponding path program 1 times [2025-03-17 05:24:39,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:39,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86240767] [2025-03-17 05:24:39,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:39,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:39,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:24:39,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:24:39,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:39,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:24:39,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:39,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86240767] [2025-03-17 05:24:39,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86240767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:39,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367109604] [2025-03-17 05:24:39,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:39,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:24:39,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:24:39,613 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 05:24:39,614 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 05:24:39,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:24:39,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:24:39,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:39,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:39,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:24:39,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:39,792 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:39,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367109604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:39,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:39,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:24:39,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623801452] [2025-03-17 05:24:39,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:39,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:24:39,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:39,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:24:39,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:24:39,794 INFO L87 Difference]: Start difference. First operand 251 states and 328 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:39,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:39,834 INFO L93 Difference]: Finished difference Result 463 states and 600 transitions. [2025-03-17 05:24:39,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:24:39,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 151 [2025-03-17 05:24:39,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:39,837 INFO L225 Difference]: With dead ends: 463 [2025-03-17 05:24:39,837 INFO L226 Difference]: Without dead ends: 257 [2025-03-17 05:24:39,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:24:39,838 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:39,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:39,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-17 05:24:39,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2025-03-17 05:24:39,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 191 states have (on average 1.1204188481675392) internal successors, (214), 192 states have internal predecessors, (214), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:24:39,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 334 transitions. [2025-03-17 05:24:39,866 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 334 transitions. Word has length 151 [2025-03-17 05:24:39,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:39,867 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 334 transitions. [2025-03-17 05:24:39,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:39,867 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 334 transitions. [2025-03-17 05:24:39,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 05:24:39,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:39,868 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:39,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 05:24:40,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 05:24:40,069 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:40,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:40,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1306803295, now seen corresponding path program 1 times [2025-03-17 05:24:40,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:40,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568123501] [2025-03-17 05:24:40,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:40,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:40,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:24:40,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:24:40,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:40,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:40,458 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:40,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:40,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568123501] [2025-03-17 05:24:40,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568123501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:40,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:40,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:24:40,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860886479] [2025-03-17 05:24:40,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:40,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:24:40,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:40,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:24:40,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:24:40,460 INFO L87 Difference]: Start difference. First operand 257 states and 334 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:40,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:40,646 INFO L93 Difference]: Finished difference Result 431 states and 553 transitions. [2025-03-17 05:24:40,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:24:40,647 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2025-03-17 05:24:40,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:40,649 INFO L225 Difference]: With dead ends: 431 [2025-03-17 05:24:40,649 INFO L226 Difference]: Without dead ends: 311 [2025-03-17 05:24:40,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:24:40,650 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 67 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:40,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 903 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:24:40,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-17 05:24:40,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 258. [2025-03-17 05:24:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 192 states have (on average 1.1197916666666667) internal successors, (215), 193 states have internal predecessors, (215), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:24:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 335 transitions. [2025-03-17 05:24:40,677 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 335 transitions. Word has length 152 [2025-03-17 05:24:40,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:40,678 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 335 transitions. [2025-03-17 05:24:40,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:40,678 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 335 transitions. [2025-03-17 05:24:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 05:24:40,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:40,679 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:40,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:24:40,679 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:40,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:40,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1352624596, now seen corresponding path program 1 times [2025-03-17 05:24:40,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:40,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515243881] [2025-03-17 05:24:40,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:40,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:40,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:24:40,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:24:40,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:40,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:40,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:40,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515243881] [2025-03-17 05:24:40,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515243881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:40,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:40,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:24:40,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351324685] [2025-03-17 05:24:40,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:40,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:24:40,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:40,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:24:40,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:24:40,931 INFO L87 Difference]: Start difference. First operand 258 states and 335 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:24:40,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:40,990 INFO L93 Difference]: Finished difference Result 409 states and 523 transitions. [2025-03-17 05:24:40,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:24:40,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 152 [2025-03-17 05:24:40,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:40,992 INFO L225 Difference]: With dead ends: 409 [2025-03-17 05:24:40,992 INFO L226 Difference]: Without dead ends: 288 [2025-03-17 05:24:40,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:24:40,993 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 40 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:40,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 698 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:40,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-17 05:24:41,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 258. [2025-03-17 05:24:41,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 192 states have (on average 1.1145833333333333) internal successors, (214), 193 states have internal predecessors, (214), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:24:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 334 transitions. [2025-03-17 05:24:41,027 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 334 transitions. Word has length 152 [2025-03-17 05:24:41,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:41,027 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 334 transitions. [2025-03-17 05:24:41,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:24:41,028 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 334 transitions. [2025-03-17 05:24:41,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 05:24:41,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:41,029 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:41,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:24:41,029 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:41,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:41,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1121254220, now seen corresponding path program 1 times [2025-03-17 05:24:41,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:41,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653725637] [2025-03-17 05:24:41,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:41,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:41,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 05:24:41,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 05:24:41,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:41,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:24:41,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1682469038] [2025-03-17 05:24:41,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:41,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:24:41,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:24:41,125 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 05:24:41,126 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 05:24:41,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 05:24:41,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 05:24:41,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:41,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:41,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 05:24:41,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:41,330 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 9 treesize of output 3 [2025-03-17 05:24:41,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 05:24:41,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 05:24:41,494 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 27 treesize of output 11 [2025-03-17 05:24:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 167 proven. 150 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2025-03-17 05:24:41,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:24:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:42,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:42,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653725637] [2025-03-17 05:24:42,323 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:24:42,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682469038] [2025-03-17 05:24:42,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682469038] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:42,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:42,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-03-17 05:24:42,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823513401] [2025-03-17 05:24:42,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:42,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:24:42,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:42,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:24:42,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:24:42,325 INFO L87 Difference]: Start difference. First operand 258 states and 334 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:42,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:42,989 INFO L93 Difference]: Finished difference Result 599 states and 751 transitions. [2025-03-17 05:24:42,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:24:42,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2025-03-17 05:24:42,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:42,992 INFO L225 Difference]: With dead ends: 599 [2025-03-17 05:24:42,992 INFO L226 Difference]: Without dead ends: 386 [2025-03-17 05:24:42,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:24:42,994 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 90 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:42,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 297 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:24:42,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-17 05:24:43,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 263. [2025-03-17 05:24:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 218 states have (on average 1.114678899082569) internal successors, (243), 218 states have internal predecessors, (243), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:24:43,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 323 transitions. [2025-03-17 05:24:43,017 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 323 transitions. Word has length 153 [2025-03-17 05:24:43,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:43,017 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 323 transitions. [2025-03-17 05:24:43,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:24:43,017 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 323 transitions. [2025-03-17 05:24:43,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 05:24:43,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:43,019 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:43,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 05:24:43,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:24:43,223 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:43,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:43,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1343873383, now seen corresponding path program 1 times [2025-03-17 05:24:43,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:43,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291116986] [2025-03-17 05:24:43,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:43,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:43,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:24:43,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:24:43,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:43,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:43,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:43,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291116986] [2025-03-17 05:24:43,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291116986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:43,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:43,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:24:43,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685903161] [2025-03-17 05:24:43,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:43,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:24:43,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:43,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:24:43,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:24:43,813 INFO L87 Difference]: Start difference. First operand 263 states and 323 transitions. Second operand has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:24:44,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:44,117 INFO L93 Difference]: Finished difference Result 484 states and 602 transitions. [2025-03-17 05:24:44,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:24:44,118 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 154 [2025-03-17 05:24:44,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:44,120 INFO L225 Difference]: With dead ends: 484 [2025-03-17 05:24:44,120 INFO L226 Difference]: Without dead ends: 329 [2025-03-17 05:24:44,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:24:44,121 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 92 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:44,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 710 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:24:44,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-17 05:24:44,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 156. [2025-03-17 05:24:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 133 states have (on average 1.1278195488721805) internal successors, (150), 133 states have internal predecessors, (150), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:24:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 190 transitions. [2025-03-17 05:24:44,133 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 190 transitions. Word has length 154 [2025-03-17 05:24:44,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:44,134 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 190 transitions. [2025-03-17 05:24:44,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:24:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 190 transitions. [2025-03-17 05:24:44,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 05:24:44,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:44,135 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:44,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:24:44,135 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:44,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:44,135 INFO L85 PathProgramCache]: Analyzing trace with hash -114314943, now seen corresponding path program 1 times [2025-03-17 05:24:44,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:44,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958364636] [2025-03-17 05:24:44,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:44,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:44,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:24:44,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:24:44,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:44,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:44,641 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:44,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:44,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958364636] [2025-03-17 05:24:44,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958364636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:44,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:44,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:24:44,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946541204] [2025-03-17 05:24:44,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:44,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:24:44,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:44,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:24:44,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:24:44,642 INFO L87 Difference]: Start difference. First operand 156 states and 190 transitions. Second operand has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:24:44,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:44,769 INFO L93 Difference]: Finished difference Result 375 states and 450 transitions. [2025-03-17 05:24:44,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:24:44,771 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 154 [2025-03-17 05:24:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:44,773 INFO L225 Difference]: With dead ends: 375 [2025-03-17 05:24:44,773 INFO L226 Difference]: Without dead ends: 220 [2025-03-17 05:24:44,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:24:44,774 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 42 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:44,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 765 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:24:44,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-17 05:24:44,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 184. [2025-03-17 05:24:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 161 states have (on average 1.1180124223602483) internal successors, (180), 161 states have internal predecessors, (180), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:24:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 220 transitions. [2025-03-17 05:24:44,790 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 220 transitions. Word has length 154 [2025-03-17 05:24:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:44,791 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 220 transitions. [2025-03-17 05:24:44,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:24:44,791 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 220 transitions. [2025-03-17 05:24:44,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 05:24:44,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:44,792 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:44,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 05:24:44,792 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:44,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:44,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1401550034, now seen corresponding path program 1 times [2025-03-17 05:24:44,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:44,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181990206] [2025-03-17 05:24:44,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:44,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:44,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 05:24:44,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 05:24:44,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:44,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:44,980 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:44,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:44,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181990206] [2025-03-17 05:24:44,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181990206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:44,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:44,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:24:44,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305061605] [2025-03-17 05:24:44,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:44,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:24:44,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:44,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:24:44,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:24:44,982 INFO L87 Difference]: Start difference. First operand 184 states and 220 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:24:45,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:45,239 INFO L93 Difference]: Finished difference Result 574 states and 682 transitions. [2025-03-17 05:24:45,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:24:45,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2025-03-17 05:24:45,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:45,241 INFO L225 Difference]: With dead ends: 574 [2025-03-17 05:24:45,241 INFO L226 Difference]: Without dead ends: 391 [2025-03-17 05:24:45,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:24:45,242 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 212 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:45,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 440 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:24:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-17 05:24:45,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 323. [2025-03-17 05:24:45,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 278 states have (on average 1.10431654676259) internal successors, (307), 278 states have internal predecessors, (307), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:24:45,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 387 transitions. [2025-03-17 05:24:45,267 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 387 transitions. Word has length 155 [2025-03-17 05:24:45,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:45,268 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 387 transitions. [2025-03-17 05:24:45,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:24:45,268 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 387 transitions. [2025-03-17 05:24:45,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 05:24:45,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:45,270 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:45,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 05:24:45,270 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:45,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:45,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1241815794, now seen corresponding path program 1 times [2025-03-17 05:24:45,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:45,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95020514] [2025-03-17 05:24:45,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:45,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:45,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 05:24:45,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 05:24:45,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:45,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:45,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:45,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95020514] [2025-03-17 05:24:45,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95020514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:45,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:45,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:24:45,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250685252] [2025-03-17 05:24:45,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:45,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:24:45,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:45,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:24:45,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:24:45,768 INFO L87 Difference]: Start difference. First operand 323 states and 387 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:24:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:46,045 INFO L93 Difference]: Finished difference Result 724 states and 868 transitions. [2025-03-17 05:24:46,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:24:46,046 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2025-03-17 05:24:46,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:46,047 INFO L225 Difference]: With dead ends: 724 [2025-03-17 05:24:46,048 INFO L226 Difference]: Without dead ends: 402 [2025-03-17 05:24:46,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:24:46,048 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 60 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:46,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1286 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:24:46,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-17 05:24:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 300. [2025-03-17 05:24:46,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 255 states have (on average 1.0980392156862746) internal successors, (280), 255 states have internal predecessors, (280), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:24:46,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 360 transitions. [2025-03-17 05:24:46,069 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 360 transitions. Word has length 155 [2025-03-17 05:24:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:46,069 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 360 transitions. [2025-03-17 05:24:46,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:24:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 360 transitions. [2025-03-17 05:24:46,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 05:24:46,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:46,071 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:46,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 05:24:46,071 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:46,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:46,072 INFO L85 PathProgramCache]: Analyzing trace with hash -767153366, now seen corresponding path program 1 times [2025-03-17 05:24:46,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:46,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287461044] [2025-03-17 05:24:46,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:46,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:46,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 05:24:46,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 05:24:46,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:46,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:47,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:47,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287461044] [2025-03-17 05:24:47,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287461044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:47,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:47,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:24:47,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333535784] [2025-03-17 05:24:47,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:47,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:24:47,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:47,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:24:47,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:24:47,076 INFO L87 Difference]: Start difference. First operand 300 states and 360 transitions. Second operand has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 05:24:48,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:48,054 INFO L93 Difference]: Finished difference Result 744 states and 900 transitions. [2025-03-17 05:24:48,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 05:24:48,055 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2025-03-17 05:24:48,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:48,058 INFO L225 Difference]: With dead ends: 744 [2025-03-17 05:24:48,058 INFO L226 Difference]: Without dead ends: 571 [2025-03-17 05:24:48,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:24:48,060 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 129 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:48,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1041 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:24:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-17 05:24:48,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 559. [2025-03-17 05:24:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 455 states have (on average 1.0835164835164834) internal successors, (493), 456 states have internal predecessors, (493), 93 states have call successors, (93), 10 states have call predecessors, (93), 10 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-17 05:24:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 679 transitions. [2025-03-17 05:24:48,106 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 679 transitions. Word has length 155 [2025-03-17 05:24:48,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:48,106 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 679 transitions. [2025-03-17 05:24:48,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 05:24:48,107 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 679 transitions. [2025-03-17 05:24:48,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 05:24:48,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:48,108 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:48,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 05:24:48,108 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:48,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:48,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1060556373, now seen corresponding path program 1 times [2025-03-17 05:24:48,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:48,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031469274] [2025-03-17 05:24:48,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:48,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:48,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 05:24:48,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 05:24:48,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:48,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:48,629 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:48,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:48,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031469274] [2025-03-17 05:24:48,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031469274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:48,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:48,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:24:48,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669909093] [2025-03-17 05:24:48,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:48,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:24:48,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:48,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:24:48,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:24:48,630 INFO L87 Difference]: Start difference. First operand 559 states and 679 transitions. Second operand has 7 states, 5 states have (on average 11.6) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 05:24:48,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:48,888 INFO L93 Difference]: Finished difference Result 1038 states and 1252 transitions. [2025-03-17 05:24:48,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:24:48,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.6) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2025-03-17 05:24:48,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:48,892 INFO L225 Difference]: With dead ends: 1038 [2025-03-17 05:24:48,892 INFO L226 Difference]: Without dead ends: 684 [2025-03-17 05:24:48,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:24:48,893 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 78 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:48,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 949 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:24:48,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-17 05:24:48,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 680. [2025-03-17 05:24:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 554 states have (on average 1.0740072202166064) internal successors, (595), 556 states have internal predecessors, (595), 112 states have call successors, (112), 13 states have call predecessors, (112), 13 states have return successors, (112), 110 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-17 05:24:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 819 transitions. [2025-03-17 05:24:48,976 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 819 transitions. Word has length 155 [2025-03-17 05:24:48,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:48,976 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 819 transitions. [2025-03-17 05:24:48,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.6) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 05:24:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 819 transitions. [2025-03-17 05:24:48,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 05:24:48,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:48,978 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:48,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 05:24:48,978 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:48,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:48,978 INFO L85 PathProgramCache]: Analyzing trace with hash -755837239, now seen corresponding path program 1 times [2025-03-17 05:24:48,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:48,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899980898] [2025-03-17 05:24:48,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:48,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:48,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 05:24:49,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 05:24:49,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:49,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:49,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:49,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899980898] [2025-03-17 05:24:49,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899980898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:49,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:49,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:24:49,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91546802] [2025-03-17 05:24:49,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:49,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:24:49,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:49,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:24:49,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:24:49,538 INFO L87 Difference]: Start difference. First operand 680 states and 819 transitions. Second operand has 9 states, 5 states have (on average 11.6) internal successors, (58), 9 states have internal predecessors, (58), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-17 05:24:49,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:49,843 INFO L93 Difference]: Finished difference Result 1288 states and 1560 transitions. [2025-03-17 05:24:49,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:24:49,844 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 5 states have (on average 11.6) internal successors, (58), 9 states have internal predecessors, (58), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 5 states have call successors, (20) Word has length 155 [2025-03-17 05:24:49,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:49,847 INFO L225 Difference]: With dead ends: 1288 [2025-03-17 05:24:49,847 INFO L226 Difference]: Without dead ends: 827 [2025-03-17 05:24:49,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:24:49,848 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 78 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:49,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 850 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:24:49,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-03-17 05:24:49,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 760. [2025-03-17 05:24:49,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 598 states have (on average 1.0618729096989967) internal successors, (635), 602 states have internal predecessors, (635), 144 states have call successors, (144), 17 states have call predecessors, (144), 17 states have return successors, (144), 140 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-17 05:24:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 923 transitions. [2025-03-17 05:24:49,908 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 923 transitions. Word has length 155 [2025-03-17 05:24:49,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:49,909 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 923 transitions. [2025-03-17 05:24:49,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 5 states have (on average 11.6) internal successors, (58), 9 states have internal predecessors, (58), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-17 05:24:49,909 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 923 transitions. [2025-03-17 05:24:49,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 05:24:49,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:49,911 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:49,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 05:24:49,911 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:49,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:49,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1049240246, now seen corresponding path program 1 times [2025-03-17 05:24:49,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:49,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797591578] [2025-03-17 05:24:49,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:49,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:49,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 05:24:49,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 05:24:49,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:49,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:50,909 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:50,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:50,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797591578] [2025-03-17 05:24:50,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797591578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:50,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:50,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:24:50,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357642561] [2025-03-17 05:24:50,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:50,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:24:50,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:50,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:24:50,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:24:50,911 INFO L87 Difference]: Start difference. First operand 760 states and 923 transitions. Second operand has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 05:24:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:51,818 INFO L93 Difference]: Finished difference Result 1265 states and 1531 transitions. [2025-03-17 05:24:51,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 05:24:51,819 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2025-03-17 05:24:51,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:51,822 INFO L225 Difference]: With dead ends: 1265 [2025-03-17 05:24:51,822 INFO L226 Difference]: Without dead ends: 764 [2025-03-17 05:24:51,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:24:51,825 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 114 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:51,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1045 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:24:51,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-03-17 05:24:51,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 698. [2025-03-17 05:24:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 554 states have (on average 1.0631768953068592) internal successors, (589), 557 states have internal predecessors, (589), 128 states have call successors, (128), 15 states have call predecessors, (128), 15 states have return successors, (128), 125 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-17 05:24:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 845 transitions. [2025-03-17 05:24:51,885 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 845 transitions. Word has length 155 [2025-03-17 05:24:51,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:51,885 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 845 transitions. [2025-03-17 05:24:51,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 05:24:51,886 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 845 transitions. [2025-03-17 05:24:51,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 05:24:51,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:51,887 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:51,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 05:24:51,887 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:51,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:51,887 INFO L85 PathProgramCache]: Analyzing trace with hash 899674459, now seen corresponding path program 1 times [2025-03-17 05:24:51,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:51,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171792163] [2025-03-17 05:24:51,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:51,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:51,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 05:24:52,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 05:24:52,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:52,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:53,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:53,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171792163] [2025-03-17 05:24:53,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171792163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:53,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:53,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 05:24:53,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609318673] [2025-03-17 05:24:53,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:53,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 05:24:53,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:53,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 05:24:53,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:24:53,942 INFO L87 Difference]: Start difference. First operand 698 states and 845 transitions. Second operand has 16 states, 14 states have (on average 4.357142857142857) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 05:24:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:54,965 INFO L93 Difference]: Finished difference Result 1068 states and 1288 transitions. [2025-03-17 05:24:54,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 05:24:54,969 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.357142857142857) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 158 [2025-03-17 05:24:54,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:54,974 INFO L225 Difference]: With dead ends: 1068 [2025-03-17 05:24:54,974 INFO L226 Difference]: Without dead ends: 798 [2025-03-17 05:24:54,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:24:54,975 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 61 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:54,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1728 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:24:54,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-03-17 05:24:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 744. [2025-03-17 05:24:55,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 585 states have (on average 1.0598290598290598) internal successors, (620), 589 states have internal predecessors, (620), 141 states have call successors, (141), 17 states have call predecessors, (141), 17 states have return successors, (141), 137 states have call predecessors, (141), 141 states have call successors, (141) [2025-03-17 05:24:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 902 transitions. [2025-03-17 05:24:55,040 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 902 transitions. Word has length 158 [2025-03-17 05:24:55,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:55,041 INFO L471 AbstractCegarLoop]: Abstraction has 744 states and 902 transitions. [2025-03-17 05:24:55,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.357142857142857) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 05:24:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 902 transitions. [2025-03-17 05:24:55,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 05:24:55,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:55,042 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:55,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 05:24:55,042 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:55,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:55,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1403832389, now seen corresponding path program 1 times [2025-03-17 05:24:55,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:55,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637920328] [2025-03-17 05:24:55,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:55,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:55,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 05:24:55,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 05:24:55,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:55,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:56,593 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:24:56,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:56,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637920328] [2025-03-17 05:24:56,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637920328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:56,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:56,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 05:24:56,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449996670] [2025-03-17 05:24:56,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:56,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:24:56,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:56,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:24:56,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:24:56,595 INFO L87 Difference]: Start difference. First operand 744 states and 902 transitions. Second operand has 17 states, 15 states have (on average 4.066666666666666) internal successors, (61), 17 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 05:24:57,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:57,561 INFO L93 Difference]: Finished difference Result 1109 states and 1338 transitions. [2025-03-17 05:24:57,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 05:24:57,562 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.066666666666666) internal successors, (61), 17 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 158 [2025-03-17 05:24:57,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:57,563 INFO L225 Difference]: With dead ends: 1109 [2025-03-17 05:24:57,563 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 05:24:57,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:24:57,565 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 61 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:57,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1695 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:24:57,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 05:24:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 05:24:57,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 05:24:57,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 05:24:57,566 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158 [2025-03-17 05:24:57,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:57,566 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 05:24:57,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.066666666666666) internal successors, (61), 17 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 05:24:57,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 05:24:57,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 05:24:57,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:24:57,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 05:24:57,572 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:57,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 05:25:27,007 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:25:27,013 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-17 05:25:27,014 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-17 05:25:27,014 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_short_int_Array_0~0!base,GLOBAL]]] [2025-03-17 05:25:27,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-17 05:25:27,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-17 05:25:27,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2025-03-17 05:25:27,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-17 05:25:27,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-17 05:25:27,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2025-03-17 05:25:27,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-17 05:25:27,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_short_int_Array_0~0!base,GLOBAL]]] [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_short_int_Array_0~0!base,GLOBAL]]] [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2025-03-17 05:25:27,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset [2025-03-17 05:25:27,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:25:27 BoogieIcfgContainer [2025-03-17 05:25:27,017 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:25:27,018 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:25:27,018 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:25:27,018 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:25:27,018 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:24:27" (3/4) ... [2025-03-17 05:25:27,024 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 05:25:27,034 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 05:25:27,041 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-17 05:25:27,042 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 05:25:27,042 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 05:25:27,042 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 05:25:27,134 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 05:25:27,135 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 05:25:27,135 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:25:27,135 INFO L158 Benchmark]: Toolchain (without parser) took 60013.39ms. Allocated memory was 142.6MB in the beginning and 872.4MB in the end (delta: 729.8MB). Free memory was 106.4MB in the beginning and 821.7MB in the end (delta: -715.3MB). Peak memory consumption was 518.9MB. Max. memory is 16.1GB. [2025-03-17 05:25:27,135 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:25:27,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.61ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 90.0MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:25:27,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.37ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 85.5MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:25:27,137 INFO L158 Benchmark]: Boogie Preprocessor took 61.35ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 81.7MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:25:27,137 INFO L158 Benchmark]: IcfgBuilder took 536.62ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 50.0MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:25:27,137 INFO L158 Benchmark]: TraceAbstraction took 59045.30ms. Allocated memory was 142.6MB in the beginning and 872.4MB in the end (delta: 729.8MB). Free memory was 49.1MB in the beginning and 322.7MB in the end (delta: -273.7MB). Peak memory consumption was 463.8MB. Max. memory is 16.1GB. [2025-03-17 05:25:27,137 INFO L158 Benchmark]: Witness Printer took 116.99ms. Allocated memory is still 872.4MB. Free memory was 322.7MB in the beginning and 821.7MB in the end (delta: -499.0MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2025-03-17 05:25:27,138 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.61ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 90.0MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.37ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 85.5MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.35ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 81.7MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 536.62ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 50.0MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 59045.30ms. Allocated memory was 142.6MB in the beginning and 872.4MB in the end (delta: 729.8MB). Free memory was 49.1MB in the beginning and 322.7MB in the end (delta: -273.7MB). Peak memory consumption was 463.8MB. Max. memory is 16.1GB. * Witness Printer took 116.99ms. Allocated memory is still 872.4MB. Free memory was 322.7MB in the beginning and 821.7MB in the end (delta: -499.0MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_short_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_short_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_short_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 149 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.6s, OverallIterations: 30, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1773 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1753 mSDsluCounter, 20546 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16392 mSDsCounter, 180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8562 IncrementalHoareTripleChecker+Invalid, 8742 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 180 mSolverCounterUnsat, 4154 mSDtfsCounter, 8562 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1849 GetRequests, 1580 SyntacticMatches, 5 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=760occurred in iteration=27, InterpolantAutomatonStates: 250, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 30 MinimizatonAttempts, 1074 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 5822 NumberOfCodeBlocks, 5822 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 5783 ConstructedInterpolants, 0 QuantifiedInterpolants, 20533 SizeOfPredicates, 16 NumberOfNonLiveVariables, 4096 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 39 InterpolantComputations, 30 PerfectInterpolantSequences, 29080/29640 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 05:25:27,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE